./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7d4fb25fbc803f31b02941dc47e3673e8088bde62ceff791efc59ea770812ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:29:39,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:29:39,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:29:39,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:29:39,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:29:39,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:29:39,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:29:39,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:29:39,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:29:39,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:29:39,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:29:39,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:29:39,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:29:39,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:29:39,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:29:39,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:29:39,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:29:39,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:29:39,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:29:39,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:29:39,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:29:39,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:29:39,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:29:39,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7d4fb25fbc803f31b02941dc47e3673e8088bde62ceff791efc59ea770812ad [2025-03-03 21:29:39,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:29:39,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:29:39,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:29:39,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:29:39,426 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:29:39,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i [2025-03-03 21:29:40,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96429cf22/90ba50bee8ce4529b213f44ad0f0ac6f/FLAGb3d888c70 [2025-03-03 21:29:40,763 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:29:40,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i [2025-03-03 21:29:40,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96429cf22/90ba50bee8ce4529b213f44ad0f0ac6f/FLAGb3d888c70 [2025-03-03 21:29:40,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96429cf22/90ba50bee8ce4529b213f44ad0f0ac6f [2025-03-03 21:29:40,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:29:40,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:29:40,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:29:40,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:29:40,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:29:40,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:40" (1/1) ... [2025-03-03 21:29:40,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef316f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:40, skipping insertion in model container [2025-03-03 21:29:40,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:40" (1/1) ... [2025-03-03 21:29:40,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:29:40,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i[919,932] [2025-03-03 21:29:40,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:29:40,993 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:29:41,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i[919,932] [2025-03-03 21:29:41,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:29:41,054 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:29:41,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41 WrapperNode [2025-03-03 21:29:41,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:29:41,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:29:41,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:29:41,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:29:41,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,100 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2025-03-03 21:29:41,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:29:41,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:29:41,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:29:41,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:29:41,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,132 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:29:41,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:29:41,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:29:41,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:29:41,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:29:41,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (1/1) ... [2025-03-03 21:29:41,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:29:41,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:29:41,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:29:41,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:29:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:29:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:29:41,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:29:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:29:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:29:41,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:29:41,266 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:29:41,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:29:41,510 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-03 21:29:41,554 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:29:41,554 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:29:41,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:29:41,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:29:41,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:41 BoogieIcfgContainer [2025-03-03 21:29:41,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:29:41,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:29:41,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:29:41,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:29:41,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:29:40" (1/3) ... [2025-03-03 21:29:41,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a174ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:41, skipping insertion in model container [2025-03-03 21:29:41,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:41" (2/3) ... [2025-03-03 21:29:41,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a174ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:41, skipping insertion in model container [2025-03-03 21:29:41,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:41" (3/3) ... [2025-03-03 21:29:41,582 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i [2025-03-03 21:29:41,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:29:41,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-64.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:29:41,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:29:41,655 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58f2a9c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:29:41,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:29:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:29:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 21:29:41,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:41,672 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:41,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1545262476, now seen corresponding path program 1 times [2025-03-03 21:29:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351904760] [2025-03-03 21:29:41,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:41,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 21:29:41,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 21:29:41,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:41,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-03 21:29:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351904760] [2025-03-03 21:29:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351904760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:29:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204093715] [2025-03-03 21:29:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:44,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:29:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:44,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:29:44,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:29:44,667 INFO L87 Difference]: Start difference. First operand has 104 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:45,045 INFO L93 Difference]: Finished difference Result 296 states and 547 transitions. [2025-03-03 21:29:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:29:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-03-03 21:29:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:45,055 INFO L225 Difference]: With dead ends: 296 [2025-03-03 21:29:45,055 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 21:29:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:29:45,065 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 160 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:45,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 824 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:29:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 21:29:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 112. [2025-03-03 21:29:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:29:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 174 transitions. [2025-03-03 21:29:45,112 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 174 transitions. Word has length 238 [2025-03-03 21:29:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:45,115 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 174 transitions. [2025-03-03 21:29:45,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 174 transitions. [2025-03-03 21:29:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 21:29:45,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:45,118 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:45,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 21:29:45,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 578458414, now seen corresponding path program 1 times [2025-03-03 21:29:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206347586] [2025-03-03 21:29:45,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 21:29:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 21:29:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-03 21:29:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206347586] [2025-03-03 21:29:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206347586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:29:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599291216] [2025-03-03 21:29:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:29:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:45,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:29:45,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:29:45,448 INFO L87 Difference]: Start difference. First operand 112 states and 174 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:45,781 INFO L93 Difference]: Finished difference Result 401 states and 623 transitions. [2025-03-03 21:29:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:29:45,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-03-03 21:29:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:45,786 INFO L225 Difference]: With dead ends: 401 [2025-03-03 21:29:45,788 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 21:29:45,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:29:45,790 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 253 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:45,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1056 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:29:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 21:29:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 127. [2025-03-03 21:29:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 87 states have internal predecessors, (124), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:29:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 200 transitions. [2025-03-03 21:29:45,817 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 200 transitions. Word has length 238 [2025-03-03 21:29:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 200 transitions. [2025-03-03 21:29:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 200 transitions. [2025-03-03 21:29:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 21:29:45,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:45,826 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:29:45,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1459597875, now seen corresponding path program 1 times [2025-03-03 21:29:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804667679] [2025-03-03 21:29:45,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:45,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 21:29:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 21:29:45,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:45,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-03 21:29:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804667679] [2025-03-03 21:29:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804667679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:29:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615291455] [2025-03-03 21:29:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:29:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:46,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:29:46,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:29:46,073 INFO L87 Difference]: Start difference. First operand 127 states and 200 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:46,285 INFO L93 Difference]: Finished difference Result 429 states and 672 transitions. [2025-03-03 21:29:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:29:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-03-03 21:29:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:46,290 INFO L225 Difference]: With dead ends: 429 [2025-03-03 21:29:46,291 INFO L226 Difference]: Without dead ends: 305 [2025-03-03 21:29:46,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:29:46,293 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 267 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:46,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 692 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:29:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-03 21:29:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 127. [2025-03-03 21:29:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 87 states have internal predecessors, (124), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:29:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 200 transitions. [2025-03-03 21:29:46,319 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 200 transitions. Word has length 238 [2025-03-03 21:29:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 200 transitions. [2025-03-03 21:29:46,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 200 transitions. [2025-03-03 21:29:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 21:29:46,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:46,324 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:29:46,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:46,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 337353484, now seen corresponding path program 1 times [2025-03-03 21:29:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:46,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878690691] [2025-03-03 21:29:46,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:46,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 21:29:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 21:29:46,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-03 21:29:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878690691] [2025-03-03 21:29:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878690691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:29:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966807327] [2025-03-03 21:29:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:29:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:46,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:29:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:29:46,529 INFO L87 Difference]: Start difference. First operand 127 states and 200 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:46,720 INFO L93 Difference]: Finished difference Result 422 states and 661 transitions. [2025-03-03 21:29:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:29:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2025-03-03 21:29:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:46,723 INFO L225 Difference]: With dead ends: 422 [2025-03-03 21:29:46,723 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 21:29:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:29:46,724 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 256 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:46,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 721 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:29:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 21:29:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 120. [2025-03-03 21:29:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 21:29:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 189 transitions. [2025-03-03 21:29:46,761 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 189 transitions. Word has length 238 [2025-03-03 21:29:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 189 transitions. [2025-03-03 21:29:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-03 21:29:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 189 transitions. [2025-03-03 21:29:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 21:29:46,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:46,764 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:46,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:29:46,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1887844214, now seen corresponding path program 1 times [2025-03-03 21:29:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:46,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155826554] [2025-03-03 21:29:46,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:46,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 21:29:46,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 21:29:46,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:46,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat