./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-ps-ci_file-3.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 b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:48:25,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:48:25,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:48:25,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:48:25,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:48:25,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:48:25,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:48:25,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:48:25,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:48:25,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:48:25,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:48:25,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:48:25,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:48:25,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:48:25,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:48:25,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:48:25,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:48:25,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:48:25,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:48:25,374 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 -> b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 [2025-03-08 12:48:25,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:48:25,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:48:25,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:48:25,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:48:25,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:48:25,611 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-ps-ci_file-3.i [2025-03-08 12:48:26,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3008dcc95/1dd5d9ed95dc4db49fcb63e2ac66d958/FLAGa190d879d [2025-03-08 12:48:26,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:48:26,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2025-03-08 12:48:26,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3008dcc95/1dd5d9ed95dc4db49fcb63e2ac66d958/FLAGa190d879d [2025-03-08 12:48:27,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3008dcc95/1dd5d9ed95dc4db49fcb63e2ac66d958 [2025-03-08 12:48:27,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:48:27,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:48:27,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:48:27,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:48:27,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:48:27,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27, skipping insertion in model container [2025-03-08 12:48:27,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:48:27,408 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-ps-ci_file-3.i[918,931] [2025-03-08 12:48:27,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:48:27,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:48:27,504 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-ps-ci_file-3.i[918,931] [2025-03-08 12:48:27,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:48:27,550 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:48:27,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27 WrapperNode [2025-03-08 12:48:27,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:48:27,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:48:27,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:48:27,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:48:27,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,588 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-03-08 12:48:27,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:48:27,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:48:27,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:48:27,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:48:27,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,620 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-08 12:48:27,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:48:27,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:48:27,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:48:27,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:48:27,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (1/1) ... [2025-03-08 12:48:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:48:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:48:27,668 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-08 12:48:27,669 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-08 12:48:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:48:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:48:27,685 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:48:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:48:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:48:27,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:48:27,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:48:27,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:48:28,150 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-08 12:48:28,177 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:48:28,178 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:48:28,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:48:28,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:48:28,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:28 BoogieIcfgContainer [2025-03-08 12:48:28,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:48:28,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:48:28,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:48:28,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:48:28,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:48:27" (1/3) ... [2025-03-08 12:48:28,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f841412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:28, skipping insertion in model container [2025-03-08 12:48:28,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:27" (2/3) ... [2025-03-08 12:48:28,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f841412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:28, skipping insertion in model container [2025-03-08 12:48:28,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:28" (3/3) ... [2025-03-08 12:48:28,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2025-03-08 12:48:28,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:48:28,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:48:28,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:48:28,267 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;@35211642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:48:28,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:48:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 80 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 12:48:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:48:28,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:28,286 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:28,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash -684315144, now seen corresponding path program 1 times [2025-03-08 12:48:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-08 12:48:28,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:48:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:48:28,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:28,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 12:48:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-08 12:48:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627024044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:48:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586486342] [2025-03-08 12:48:28,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:28,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:48:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:48:28,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:48:28,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:48:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:48:28,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:48:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:28,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:48:28,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:48:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 12:48:28,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:48:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586486342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:28,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:48:28,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:48:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981923982] [2025-03-08 12:48:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:48:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:28,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:48:28,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:48:28,740 INFO L87 Difference]: Start difference. First operand has 105 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 80 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:28,769 INFO L93 Difference]: Finished difference Result 204 states and 354 transitions. [2025-03-08 12:48:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:48:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 160 [2025-03-08 12:48:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:28,777 INFO L225 Difference]: With dead ends: 204 [2025-03-08 12:48:28,778 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 12:48:28,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:48:28,784 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:28,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:48:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 12:48:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 12:48:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 77 states have internal predecessors, (116), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 12:48:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2025-03-08 12:48:28,820 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 160 [2025-03-08 12:48:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:28,821 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2025-03-08 12:48:28,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2025-03-08 12:48:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:48:28,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:28,823 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:28,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:48:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:48:29,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -511553161, now seen corresponding path program 1 times [2025-03-08 12:48:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452346508] [2025-03-08 12:48:29,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:48:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:48:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452346508] [2025-03-08 12:48:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452346508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:48:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172124134] [2025-03-08 12:48:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:29,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:48:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:29,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:48:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,386 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:29,461 INFO L93 Difference]: Finished difference Result 300 states and 480 transitions. [2025-03-08 12:48:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:48:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-03-08 12:48:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:29,464 INFO L225 Difference]: With dead ends: 300 [2025-03-08 12:48:29,466 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 12:48:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,468 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 113 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:29,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 301 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:48:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 12:48:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-03-08 12:48:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 150 states have (on average 1.48) internal successors, (222), 150 states have internal predecessors, (222), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 12:48:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 314 transitions. [2025-03-08 12:48:29,493 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 314 transitions. Word has length 160 [2025-03-08 12:48:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:29,494 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 314 transitions. [2025-03-08 12:48:29,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 314 transitions. [2025-03-08 12:48:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:48:29,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:29,496 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:29,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:48:29,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 592480051, now seen corresponding path program 1 times [2025-03-08 12:48:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642343844] [2025-03-08 12:48:29,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:29,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:48:29,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:48:29,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:29,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642343844] [2025-03-08 12:48:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642343844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:29,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:29,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:48:29,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118174631] [2025-03-08 12:48:29,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:29,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:48:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:29,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:48:29,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,614 INFO L87 Difference]: Start difference. First operand 199 states and 314 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:29,675 INFO L93 Difference]: Finished difference Result 461 states and 724 transitions. [2025-03-08 12:48:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:48:29,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-08 12:48:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:29,681 INFO L225 Difference]: With dead ends: 461 [2025-03-08 12:48:29,683 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 12:48:29,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,685 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:29,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 322 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:48:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 12:48:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2025-03-08 12:48:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 12:48:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 342 transitions. [2025-03-08 12:48:29,717 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 342 transitions. Word has length 162 [2025-03-08 12:48:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 342 transitions. [2025-03-08 12:48:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 342 transitions. [2025-03-08 12:48:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:48:29,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:29,723 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:29,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:48:29,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:29,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 446715444, now seen corresponding path program 1 times [2025-03-08 12:48:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:29,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-08 12:48:29,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:29,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:48:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:48:29,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:29,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-08 12:48:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392974348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:29,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:29,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:48:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398924177] [2025-03-08 12:48:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:29,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:48:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:29,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:48:29,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,872 INFO L87 Difference]: Start difference. First operand 219 states and 342 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:29,976 INFO L93 Difference]: Finished difference Result 639 states and 1005 transitions. [2025-03-08 12:48:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:48:29,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-08 12:48:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:29,979 INFO L225 Difference]: With dead ends: 639 [2025-03-08 12:48:29,979 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 12:48:29,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:29,982 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 141 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:29,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 367 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:48:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 12:48:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2025-03-08 12:48:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 324 states have (on average 1.4598765432098766) internal successors, (473), 324 states have internal predecessors, (473), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 12:48:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 657 transitions. [2025-03-08 12:48:30,026 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 657 transitions. Word has length 162 [2025-03-08 12:48:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:30,027 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 657 transitions. [2025-03-08 12:48:30,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 657 transitions. [2025-03-08 12:48:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:48:30,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:30,031 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:30,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:48:30,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:30,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:30,032 INFO L85 PathProgramCache]: Analyzing trace with hash 894584380, now seen corresponding path program 1 times [2025-03-08 12:48:30,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:30,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-03-08 12:48:30,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:30,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:48:30,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:48:30,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:30,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-03-08 12:48:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698969760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:48:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276988702] [2025-03-08 12:48:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:30,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:48:30,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:30,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:48:30,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:30,221 INFO L87 Difference]: Start difference. First operand 421 states and 657 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:30,342 INFO L93 Difference]: Finished difference Result 1055 states and 1650 transitions. [2025-03-08 12:48:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:48:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2025-03-08 12:48:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:30,348 INFO L225 Difference]: With dead ends: 1055 [2025-03-08 12:48:30,348 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 12:48:30,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:48:30,350 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 115 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:30,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 300 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:48:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 12:48:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2025-03-08 12:48:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 490 states have (on average 1.4551020408163264) internal successors, (713), 490 states have internal predecessors, (713), 138 states have call successors, (138), 6 states have call predecessors, (138), 6 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-08 12:48:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 989 transitions. [2025-03-08 12:48:30,403 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 989 transitions. Word has length 163 [2025-03-08 12:48:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:30,403 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 989 transitions. [2025-03-08 12:48:30,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 989 transitions. [2025-03-08 12:48:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:48:30,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:30,404 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:30,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:48:30,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:30,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1901130578, now seen corresponding path program 1 times [2025-03-08 12:48:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980275231] [2025-03-08 12:48:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:30,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:48:30,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:48:30,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:30,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980275231] [2025-03-08 12:48:30,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980275231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:30,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:30,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:48:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273433193] [2025-03-08 12:48:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:30,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:48:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:30,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:48:30,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:48:30,758 INFO L87 Difference]: Start difference. First operand 635 states and 989 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:31,358 INFO L93 Difference]: Finished difference Result 2121 states and 3308 transitions. [2025-03-08 12:48:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:48:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 165 [2025-03-08 12:48:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:31,367 INFO L225 Difference]: With dead ends: 2121 [2025-03-08 12:48:31,367 INFO L226 Difference]: Without dead ends: 1489 [2025-03-08 12:48:31,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:48:31,369 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 465 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:31,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 614 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:48:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-08 12:48:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1475. [2025-03-08 12:48:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1138 states have (on average 1.4569420035149385) internal successors, (1658), 1138 states have internal predecessors, (1658), 322 states have call successors, (322), 14 states have call predecessors, (322), 14 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) [2025-03-08 12:48:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2302 transitions. [2025-03-08 12:48:31,488 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2302 transitions. Word has length 165 [2025-03-08 12:48:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:31,488 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 2302 transitions. [2025-03-08 12:48:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2302 transitions. [2025-03-08 12:48:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:48:31,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:31,490 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:48:31,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:31,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1030281293, now seen corresponding path program 1 times [2025-03-08 12:48:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149467409] [2025-03-08 12:48:31,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:31,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:48:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:48:31,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149467409] [2025-03-08 12:48:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149467409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:48:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114209545] [2025-03-08 12:48:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:48:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:32,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:48:32,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:48:32,281 INFO L87 Difference]: Start difference. First operand 1475 states and 2302 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:32,794 INFO L93 Difference]: Finished difference Result 3997 states and 6158 transitions. [2025-03-08 12:48:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:48:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2025-03-08 12:48:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:32,811 INFO L225 Difference]: With dead ends: 3997 [2025-03-08 12:48:32,812 INFO L226 Difference]: Without dead ends: 2953 [2025-03-08 12:48:32,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:48:32,817 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 241 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:32,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 535 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:48:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2025-03-08 12:48:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2543. [2025-03-08 12:48:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2108 states have (on average 1.4905123339658444) internal successors, (3142), 2122 states have internal predecessors, (3142), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 12:48:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3954 transitions. [2025-03-08 12:48:32,965 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3954 transitions. Word has length 165 [2025-03-08 12:48:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:32,965 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3954 transitions. [2025-03-08 12:48:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3954 transitions. [2025-03-08 12:48:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 12:48:32,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:32,970 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:48:32,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1043972734, now seen corresponding path program 1 times [2025-03-08 12:48:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505302019] [2025-03-08 12:48:32,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:32,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 12:48:33,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 12:48:33,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:33,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505302019] [2025-03-08 12:48:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505302019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:33,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:48:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716124375] [2025-03-08 12:48:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:48:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:48:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:48:33,720 INFO L87 Difference]: Start difference. First operand 2543 states and 3954 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:34,304 INFO L93 Difference]: Finished difference Result 5867 states and 9053 transitions. [2025-03-08 12:48:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:48:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2025-03-08 12:48:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:34,324 INFO L225 Difference]: With dead ends: 5867 [2025-03-08 12:48:34,324 INFO L226 Difference]: Without dead ends: 4035 [2025-03-08 12:48:34,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:48:34,330 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 262 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:34,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 536 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:48:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2025-03-08 12:48:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 2543. [2025-03-08 12:48:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2108 states have (on average 1.4905123339658444) internal successors, (3142), 2122 states have internal predecessors, (3142), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 12:48:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3954 transitions. [2025-03-08 12:48:34,469 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3954 transitions. Word has length 166 [2025-03-08 12:48:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:34,469 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3954 transitions. [2025-03-08 12:48:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3954 transitions. [2025-03-08 12:48:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 12:48:34,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:34,472 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:34,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:48:34,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:34,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash 464291103, now seen corresponding path program 1 times [2025-03-08 12:48:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480743941] [2025-03-08 12:48:34,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:34,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 12:48:34,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 12:48:34,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480743941] [2025-03-08 12:48:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480743941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:48:34,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660711123] [2025-03-08 12:48:34,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:34,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:48:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:34,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:48:34,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:48:34,659 INFO L87 Difference]: Start difference. First operand 2543 states and 3954 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:34,988 INFO L93 Difference]: Finished difference Result 4393 states and 6819 transitions. [2025-03-08 12:48:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:48:34,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2025-03-08 12:48:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:35,003 INFO L225 Difference]: With dead ends: 4393 [2025-03-08 12:48:35,003 INFO L226 Difference]: Without dead ends: 3117 [2025-03-08 12:48:35,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:48:35,007 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 288 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:35,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 566 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:48:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2025-03-08 12:48:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 2743. [2025-03-08 12:48:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2308 states have (on average 1.4939341421143848) internal successors, (3448), 2322 states have internal predecessors, (3448), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 12:48:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4260 transitions. [2025-03-08 12:48:35,137 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4260 transitions. Word has length 166 [2025-03-08 12:48:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:35,138 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 4260 transitions. [2025-03-08 12:48:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:48:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4260 transitions. [2025-03-08 12:48:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 12:48:35,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:35,141 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:48:35,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:35,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2073531136, now seen corresponding path program 1 times [2025-03-08 12:48:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832436806] [2025-03-08 12:48:35,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 12:48:35,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 12:48:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 12:48:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832436806] [2025-03-08 12:48:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832436806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:48:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401333667] [2025-03-08 12:48:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:35,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:48:35,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:48:35,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:48:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:48:36,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 12:48:36,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 12:48:36,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:36,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:36,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 12:48:36,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:48:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 644 proven. 69 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-08 12:48:36,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:48:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 12:48:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401333667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:48:37,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:48:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 8] total 26 [2025-03-08 12:48:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715672792] [2025-03-08 12:48:37,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:48:37,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 12:48:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:37,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 12:48:37,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-03-08 12:48:37,188 INFO L87 Difference]: Start difference. First operand 2743 states and 4260 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (39), 4 states have call predecessors, (39), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) [2025-03-08 12:48:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:46,360 INFO L93 Difference]: Finished difference Result 20563 states and 30588 transitions. [2025-03-08 12:48:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2025-03-08 12:48:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (39), 4 states have call predecessors, (39), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) Word has length 166 [2025-03-08 12:48:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:46,436 INFO L225 Difference]: With dead ends: 20563 [2025-03-08 12:48:46,436 INFO L226 Difference]: Without dead ends: 17823 [2025-03-08 12:48:46,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16785 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8040, Invalid=32966, Unknown=0, NotChecked=0, Total=41006 [2025-03-08 12:48:46,456 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 4405 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 3835 mSolverCounterSat, 870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 4705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 870 IncrementalHoareTripleChecker+Valid, 3835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:46,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 2464 Invalid, 4705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [870 Valid, 3835 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 12:48:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17823 states. [2025-03-08 12:48:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17823 to 7665. [2025-03-08 12:48:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7665 states, 6712 states have (on average 1.470798569725864) internal successors, (9872), 6770 states have internal predecessors, (9872), 769 states have call successors, (769), 183 states have call predecessors, (769), 183 states have return successors, (769), 711 states have call predecessors, (769), 769 states have call successors, (769) [2025-03-08 12:48:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 11410 transitions. [2025-03-08 12:48:47,065 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 11410 transitions. Word has length 166 [2025-03-08 12:48:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:47,066 INFO L471 AbstractCegarLoop]: Abstraction has 7665 states and 11410 transitions. [2025-03-08 12:48:47,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (39), 4 states have call predecessors, (39), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) [2025-03-08 12:48:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 11410 transitions. [2025-03-08 12:48:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 12:48:47,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:47,077 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:47,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:48:47,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 12:48:47,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1730217181, now seen corresponding path program 1 times [2025-03-08 12:48:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284273986] [2025-03-08 12:48:47,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:47,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:47,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:47,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:48:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284273986] [2025-03-08 12:48:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284273986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:48:47,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:48:47,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:48:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890693672] [2025-03-08 12:48:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:48:47,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:48:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:47,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:48:47,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:48:47,518 INFO L87 Difference]: Start difference. First operand 7665 states and 11410 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:48,244 INFO L93 Difference]: Finished difference Result 15422 states and 22927 transitions. [2025-03-08 12:48:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:48:48,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 167 [2025-03-08 12:48:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:48,271 INFO L225 Difference]: With dead ends: 15422 [2025-03-08 12:48:48,272 INFO L226 Difference]: Without dead ends: 7768 [2025-03-08 12:48:48,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:48:48,287 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 506 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:48,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 722 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:48:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-03-08 12:48:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7691. [2025-03-08 12:48:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7691 states, 6738 states have (on average 1.4670525378450578) internal successors, (9885), 6796 states have internal predecessors, (9885), 769 states have call successors, (769), 183 states have call predecessors, (769), 183 states have return successors, (769), 711 states have call predecessors, (769), 769 states have call successors, (769) [2025-03-08 12:48:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7691 states to 7691 states and 11423 transitions. [2025-03-08 12:48:48,735 INFO L78 Accepts]: Start accepts. Automaton has 7691 states and 11423 transitions. Word has length 167 [2025-03-08 12:48:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 7691 states and 11423 transitions. [2025-03-08 12:48:48,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:48:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7691 states and 11423 transitions. [2025-03-08 12:48:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 12:48:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:48,741 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:48,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:48:48,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1884678429, now seen corresponding path program 1 times [2025-03-08 12:48:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165842122] [2025-03-08 12:48:48,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:48,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:48,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:48,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:48,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 36 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-08 12:48:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:48:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165842122] [2025-03-08 12:48:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165842122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:48:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004574994] [2025-03-08 12:48:50,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:50,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:48:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:48:50,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:48:50,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:48:50,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:50,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:50,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:50,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:50,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 12:48:50,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:48:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 650 proven. 84 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-08 12:48:51,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:48:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2025-03-08 12:48:51,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004574994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:48:51,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:48:51,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 11] total 32 [2025-03-08 12:48:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233897995] [2025-03-08 12:48:51,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:48:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 12:48:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:48:51,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 12:48:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2025-03-08 12:48:51,755 INFO L87 Difference]: Start difference. First operand 7691 states and 11423 transitions. Second operand has 32 states, 32 states have (on average 4.53125) internal successors, (145), 31 states have internal predecessors, (145), 9 states have call successors, (42), 5 states have call predecessors, (42), 10 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2025-03-08 12:48:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:58,501 INFO L93 Difference]: Finished difference Result 34350 states and 49855 transitions. [2025-03-08 12:48:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-03-08 12:48:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.53125) internal successors, (145), 31 states have internal predecessors, (145), 9 states have call successors, (42), 5 states have call predecessors, (42), 10 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) Word has length 167 [2025-03-08 12:48:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:58,562 INFO L225 Difference]: With dead ends: 34350 [2025-03-08 12:48:58,562 INFO L226 Difference]: Without dead ends: 26670 [2025-03-08 12:48:58,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7568 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5009, Invalid=16453, Unknown=0, NotChecked=0, Total=21462 [2025-03-08 12:48:58,579 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 3842 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3856 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3856 Valid, 1668 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 12:48:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26670 states. [2025-03-08 12:48:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26670 to 10805. [2025-03-08 12:48:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10805 states, 9424 states have (on average 1.4482173174872666) internal successors, (13648), 9524 states have internal predecessors, (13648), 1080 states have call successors, (1080), 300 states have call predecessors, (1080), 300 states have return successors, (1080), 980 states have call predecessors, (1080), 1080 states have call successors, (1080) [2025-03-08 12:48:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 15808 transitions. [2025-03-08 12:48:59,305 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 15808 transitions. Word has length 167 [2025-03-08 12:48:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 10805 states and 15808 transitions. [2025-03-08 12:48:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.53125) internal successors, (145), 31 states have internal predecessors, (145), 9 states have call successors, (42), 5 states have call predecessors, (42), 10 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2025-03-08 12:48:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 15808 transitions. [2025-03-08 12:48:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 12:48:59,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:59,309 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:48:59,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:48:59,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:48:59,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash -423122277, now seen corresponding path program 1 times [2025-03-08 12:48:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:48:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786215815] [2025-03-08 12:48:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:48:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:59,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:59,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:59,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:48:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835454266] [2025-03-08 12:48:59,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:59,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:48:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:48:59,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:48:59,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 12:48:59,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:59,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:59,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:48:59,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:48:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 12:48:59,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 12:48:59,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:59,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:48:59,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:48:59,882 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:48:59,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:48:59,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 12:49:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:49:00,093 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:49:00,186 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:49:00,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:49:00 BoogieIcfgContainer [2025-03-08 12:49:00,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:49:00,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:49:00,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:49:00,189 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:49:00,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:28" (3/4) ... [2025-03-08 12:49:00,191 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:49:00,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:49:00,192 INFO L158 Benchmark]: Toolchain (without parser) took 32908.78ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 124.8MB in the beginning and 1.1GB in the end (delta: -995.2MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,192 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:49:00,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.97ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 109.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.29ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 104.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:49:00,193 INFO L158 Benchmark]: Boogie Preprocessor took 55.13ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 99.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,193 INFO L158 Benchmark]: IcfgBuilder took 547.74ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 66.1MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,193 INFO L158 Benchmark]: TraceAbstraction took 31994.45ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,194 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 405.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:49:00,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.97ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 109.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.29ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 104.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.13ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 99.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 547.74ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 66.1MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31994.45ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 65.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 405.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 126, overapproximation of bitwiseOr at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] double var_1_32 = 0.0; [L41] unsigned short int var_1_34 = 34858; [L42] unsigned short int var_1_35 = 41225; [L43] double var_1_37 = 63.63; [L44] signed char var_1_39 = 10; [L45] signed char var_1_40 = -25; [L46] signed char var_1_41 = 4; [L47] unsigned char var_1_42 = 50; [L48] unsigned long int last_1_var_1_10 = 256; [L49] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L171] last_1_var_1_10 = var_1_10 [L172] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L182] RET updateLastVariables() [L183] CALL updateVariables() [L134] var_1_3 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L137] var_1_5 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L138] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L139] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L139] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L140] var_1_13 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L141] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L142] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L143] var_1_14 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L144] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L145] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L146] var_1_15 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L148] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L149] var_1_16 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L151] var_1_21 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L152] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L153] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L154] var_1_22 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L155] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L156] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L156] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L157] var_1_34 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L159] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L160] var_1_35 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L161] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L162] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L163] var_1_40 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L164] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L165] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=-1, var_1_6=256] [L166] var_1_41 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L167] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L168] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L168] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L183] RET updateVariables() [L184] CALL step() [L53] COND FALSE !(var_1_20 >= ((((var_1_14) > (var_1_23)) ? (var_1_14) : (var_1_23)))) [L56] var_1_24 = (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L58] var_1_28 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L59] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L59] COND TRUE ((var_1_6 ^ var_1_20) % var_1_21) > -10 [L60] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L62] EXPR ((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L62] COND TRUE (~ var_1_5) <= (((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16) [L63] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L71] EXPR var_1_35 & var_1_14 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L71] EXPR (var_1_35 & var_1_14) >> var_1_22 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L71] COND TRUE var_1_20 >= ((var_1_35 & var_1_14) >> var_1_22) [L72] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L74] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L75] COND FALSE !(var_1_22 > var_1_21) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L88] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L93] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-1, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L94] COND TRUE stepLocal_2 > last_1_var_1_10 [L95] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L97] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L98] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L102] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L103] COND FALSE !(stepLocal_1 || var_1_3) [L108] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L110] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L121] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L126] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L126] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L127] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=127, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=-1, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 191 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 13, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10456 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10421 mSDsluCounter, 8551 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6427 mSDsCounter, 2461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7855 IncrementalHoareTripleChecker+Invalid, 10316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2461 mSolverCounterUnsat, 2124 mSDtfsCounter, 7855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1269 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24372 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10805occurred in iteration=12, InterpolantAutomatonStates: 352, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 28442 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2796 NumberOfCodeBlocks, 2796 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2778 ConstructedInterpolants, 0 QuantifiedInterpolants, 12676 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1166 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 16902/17204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:49:00,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-ps-ci_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:49:02,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:49:02,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:49:02,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:49:02,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:49:02,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:49:02,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:49:02,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:49:02,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:49:02,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:49:02,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:49:02,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:49:02,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:49:02,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:49:02,219 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:49:02,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:49:02,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:49:02,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:49:02,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:49:02,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:49:02,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:49:02,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:49:02,223 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 -> b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 [2025-03-08 12:49:02,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:49:02,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:49:02,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:49:02,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:49:02,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:49:02,453 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-ps-ci_file-3.i [2025-03-08 12:49:03,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566e60627/2fce243f345447f68a91ff94cbe17860/FLAG56fdee8a5 [2025-03-08 12:49:03,822 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:49:03,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2025-03-08 12:49:03,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566e60627/2fce243f345447f68a91ff94cbe17860/FLAG56fdee8a5 [2025-03-08 12:49:04,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566e60627/2fce243f345447f68a91ff94cbe17860 [2025-03-08 12:49:04,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:49:04,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:49:04,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:49:04,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:49:04,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:49:04,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e265e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04, skipping insertion in model container [2025-03-08 12:49:04,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:49:04,287 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-ps-ci_file-3.i[918,931] [2025-03-08 12:49:04,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:49:04,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:49:04,380 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-ps-ci_file-3.i[918,931] [2025-03-08 12:49:04,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:49:04,424 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:49:04,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04 WrapperNode [2025-03-08 12:49:04,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:49:04,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:49:04,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:49:04,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:49:04,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,462 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-08 12:49:04,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:49:04,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:49:04,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:49:04,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:49:04,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,491 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-08 12:49:04,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:49:04,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:49:04,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:49:04,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:49:04,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (1/1) ... [2025-03-08 12:49:04,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:49:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:49:04,535 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-08 12:49:04,540 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-08 12:49:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:49:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:49:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:49:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:49:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:49:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:49:04,623 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:49:04,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:49:19,970 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 12:49:19,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:49:19,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:49:19,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:49:19,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:19 BoogieIcfgContainer [2025-03-08 12:49:19,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:49:19,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:49:19,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:49:19,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:49:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:49:04" (1/3) ... [2025-03-08 12:49:19,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da4aa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:19, skipping insertion in model container [2025-03-08 12:49:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:04" (2/3) ... [2025-03-08 12:49:19,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da4aa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:19, skipping insertion in model container [2025-03-08 12:49:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:19" (3/3) ... [2025-03-08 12:49:19,985 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2025-03-08 12:49:19,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:49:19,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:49:20,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:49:20,058 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;@4ca994ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:49:20,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:49:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 12:49:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 12:49:20,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:49:20,069 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:49:20,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:49:20,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:49:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1059184094, now seen corresponding path program 1 times [2025-03-08 12:49:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:49:20,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719230955] [2025-03-08 12:49:20,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:49:20,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:49:20,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:49:20,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:49:20,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:49:20,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 12:49:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 12:49:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:49:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:49:21,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:49:21,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:49:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-08 12:49:21,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:49:21,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:49:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719230955] [2025-03-08 12:49:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719230955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:49:21,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:49:21,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:49:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386744955] [2025-03-08 12:49:21,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:49:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:49:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:49:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:49:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:49:21,108 INFO L87 Difference]: Start difference. First operand has 82 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:49:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:49:21,125 INFO L93 Difference]: Finished difference Result 158 states and 278 transitions. [2025-03-08 12:49:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:49:21,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-03-08 12:49:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:49:21,131 INFO L225 Difference]: With dead ends: 158 [2025-03-08 12:49:21,131 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 12:49:21,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:49:21,135 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:49:21,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:49:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 12:49:21,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 12:49:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 12:49:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-08 12:49:21,167 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 153 [2025-03-08 12:49:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:49:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-08 12:49:21,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 12:49:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-08 12:49:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 12:49:21,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:49:21,169 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:49:21,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:49:21,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:49:21,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:49:21,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:49:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1253400451, now seen corresponding path program 1 times [2025-03-08 12:49:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:49:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363799017] [2025-03-08 12:49:21,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:49:21,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:49:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:49:21,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:49:21,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:49:21,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 12:49:22,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 12:49:22,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:49:22,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:49:22,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:49:22,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:49:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 12:49:26,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:49:26,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:49:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363799017] [2025-03-08 12:49:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363799017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:49:26,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:49:26,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:49:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885670804] [2025-03-08 12:49:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:49:26,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:49:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:49:26,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:49:26,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:49:26,139 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 12:49:30,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:34,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:37,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:42,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:45,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:47,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:49:49,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []