./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.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 6d6d2a27a426d678f634c04aba0efcc19886c221afd32b2e1f3bd78b6ab660f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:01:11,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:01:11,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:01:11,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:01:11,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:01:11,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:01:11,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:01:11,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:01:11,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:01:11,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:01:11,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:01:11,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:01:11,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:01:11,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:01:11,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:01:11,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:01:11,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:01:11,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:01:11,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:01:11,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:01:11,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:01:11,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:01:11,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:01:11,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:01:11,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:01:11,421 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 -> 6d6d2a27a426d678f634c04aba0efcc19886c221afd32b2e1f3bd78b6ab660f1 [2025-03-03 21:01:11,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:01:11,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:01:11,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:01:11,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:01:11,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:01:11,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:12,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e37fecf/b2d6efef8ba74b529a7fd167b700946b/FLAGd44dcb1d7 [2025-03-03 21:01:13,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:01:13,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:13,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e37fecf/b2d6efef8ba74b529a7fd167b700946b/FLAGd44dcb1d7 [2025-03-03 21:01:13,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e37fecf/b2d6efef8ba74b529a7fd167b700946b [2025-03-03 21:01:13,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:01:13,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:01:13,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:01:13,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:01:13,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:01:13,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9ce730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13, skipping insertion in model container [2025-03-03 21:01:13,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:01:13,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i[919,932] [2025-03-03 21:01:13,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:01:13,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:01:13,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i[919,932] [2025-03-03 21:01:13,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:01:13,508 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:01:13,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13 WrapperNode [2025-03-03 21:01:13,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:01:13,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:01:13,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:01:13,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:01:13,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,564 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 264 [2025-03-03 21:01:13,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:01:13,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:01:13,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:01:13,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:01:13,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:01:13,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:01:13,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:01:13,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:01:13,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:01:13,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (1/1) ... [2025-03-03 21:01:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:01:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:13,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:01:13,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:01:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:01:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:01:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:01:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:01:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:01:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:01:13,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:01:13,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:01:14,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1; [2025-03-03 21:01:14,239 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 21:01:14,239 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:01:14,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:01:14,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:01:14,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:01:14 BoogieIcfgContainer [2025-03-03 21:01:14,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:01:14,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:01:14,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:01:14,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:01:14,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:01:13" (1/3) ... [2025-03-03 21:01:14,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e96c308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:01:14, skipping insertion in model container [2025-03-03 21:01:14,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:13" (2/3) ... [2025-03-03 21:01:14,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e96c308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:01:14, skipping insertion in model container [2025-03-03 21:01:14,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:01:14" (3/3) ... [2025-03-03 21:01:14,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:14,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:01:14,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:01:14,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:01:14,343 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;@29728066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:01:14,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:01:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:01:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 21:01:14,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:14,378 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:14,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1389047086, now seen corresponding path program 1 times [2025-03-03 21:01:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783822951] [2025-03-03 21:01:14,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:14,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:01:14,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:01:14,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 21:01:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783822951] [2025-03-03 21:01:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783822951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:01:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061155751] [2025-03-03 21:01:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:14,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:14,705 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-03 21:01:14,706 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-03 21:01:14,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:01:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:01:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:14,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:01:14,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 21:01:14,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:01:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061155751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:01:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:01:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232175576] [2025-03-03 21:01:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:14,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:01:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:14,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:01:14,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:01:14,918 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:14,950 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2025-03-03 21:01:14,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:01:14,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2025-03-03 21:01:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:14,958 INFO L225 Difference]: With dead ends: 211 [2025-03-03 21:01:14,959 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 21:01:14,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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-03 21:01:14,967 INFO L435 NwaCegarLoop]: 153 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, 153 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-03 21:01:14,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 21:01:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-03 21:01:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:01:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2025-03-03 21:01:15,011 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 186 [2025-03-03 21:01:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:15,012 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2025-03-03 21:01:15,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2025-03-03 21:01:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 21:01:15,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:15,016 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:15,026 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-03 21:01:15,217 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-03 21:01:15,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 57976270, now seen corresponding path program 1 times [2025-03-03 21:01:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682404843] [2025-03-03 21:01:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:15,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:01:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:01:15,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:15,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682404843] [2025-03-03 21:01:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682404843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:15,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:01:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308644621] [2025-03-03 21:01:15,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:01:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:15,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:01:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:01:15,669 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:15,746 INFO L93 Difference]: Finished difference Result 293 states and 455 transitions. [2025-03-03 21:01:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:01:15,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-03 21:01:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:15,749 INFO L225 Difference]: With dead ends: 293 [2025-03-03 21:01:15,749 INFO L226 Difference]: Without dead ends: 192 [2025-03-03 21:01:15,750 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-03 21:01:15,750 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 75 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:15,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 287 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-03 21:01:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2025-03-03 21:01:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 123 states have internal predecessors, (169), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:01:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 281 transitions. [2025-03-03 21:01:15,788 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 281 transitions. Word has length 186 [2025-03-03 21:01:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:15,788 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 281 transitions. [2025-03-03 21:01:15,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 281 transitions. [2025-03-03 21:01:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:01:15,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:15,790 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:15,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:01:15,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -78203283, now seen corresponding path program 1 times [2025-03-03 21:01:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370920382] [2025-03-03 21:01:15,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:15,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:01:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:01:15,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:15,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370920382] [2025-03-03 21:01:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370920382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:01:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540611830] [2025-03-03 21:01:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:16,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:01:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:16,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:01:16,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:01:16,185 INFO L87 Difference]: Start difference. First operand 182 states and 281 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:16,261 INFO L93 Difference]: Finished difference Result 294 states and 456 transitions. [2025-03-03 21:01:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:01:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2025-03-03 21:01:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:16,264 INFO L225 Difference]: With dead ends: 294 [2025-03-03 21:01:16,264 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 21:01:16,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:01:16,268 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 75 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:16,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 429 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 21:01:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2025-03-03 21:01:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:01:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 284 transitions. [2025-03-03 21:01:16,300 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 284 transitions. Word has length 187 [2025-03-03 21:01:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:16,301 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 284 transitions. [2025-03-03 21:01:16,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 284 transitions. [2025-03-03 21:01:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:01:16,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:16,305 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:16,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:01:16,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1405892103, now seen corresponding path program 1 times [2025-03-03 21:01:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518280300] [2025-03-03 21:01:16,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:16,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:01:16,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:01:16,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518280300] [2025-03-03 21:01:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518280300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:01:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815694028] [2025-03-03 21:01:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:16,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:01:16,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:16,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:01:16,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:01:16,632 INFO L87 Difference]: Start difference. First operand 184 states and 284 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:16,776 INFO L93 Difference]: Finished difference Result 422 states and 642 transitions. [2025-03-03 21:01:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:01:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2025-03-03 21:01:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:16,782 INFO L225 Difference]: With dead ends: 422 [2025-03-03 21:01:16,782 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 21:01:16,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:01:16,783 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 159 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:16,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 488 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:01:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 21:01:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2025-03-03 21:01:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 206 states have (on average 1.412621359223301) internal successors, (291), 207 states have internal predecessors, (291), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:01:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2025-03-03 21:01:16,810 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 188 [2025-03-03 21:01:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2025-03-03 21:01:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2025-03-03 21:01:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:01:16,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:16,813 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:01:16,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash -401562360, now seen corresponding path program 1 times [2025-03-03 21:01:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481327574] [2025-03-03 21:01:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:01:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:01:16,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481327574] [2025-03-03 21:01:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481327574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:18,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:01:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881202654] [2025-03-03 21:01:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:18,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:01:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:18,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:01:18,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:01:18,174 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:18,598 INFO L93 Difference]: Finished difference Result 777 states and 1189 transitions. [2025-03-03 21:01:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:01:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2025-03-03 21:01:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:18,603 INFO L225 Difference]: With dead ends: 777 [2025-03-03 21:01:18,603 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 21:01:18,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:01:18,604 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 320 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:18,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 445 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:01:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 21:01:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 574. [2025-03-03 21:01:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 479 states have (on average 1.488517745302714) internal successors, (713), 482 states have internal predecessors, (713), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 21:01:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 885 transitions. [2025-03-03 21:01:18,645 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 885 transitions. Word has length 188 [2025-03-03 21:01:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:18,646 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 885 transitions. [2025-03-03 21:01:18,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 885 transitions. [2025-03-03 21:01:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:01:18,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:18,649 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:01:18,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -810386585, now seen corresponding path program 1 times [2025-03-03 21:01:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975110443] [2025-03-03 21:01:18,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:01:18,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:01:18,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:18,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975110443] [2025-03-03 21:01:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975110443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:01:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841896668] [2025-03-03 21:01:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:18,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:01:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:18,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:01:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:01:18,744 INFO L87 Difference]: Start difference. First operand 574 states and 885 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:18,794 INFO L93 Difference]: Finished difference Result 925 states and 1418 transitions. [2025-03-03 21:01:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:01:18,794 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2025-03-03 21:01:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:18,797 INFO L225 Difference]: With dead ends: 925 [2025-03-03 21:01:18,797 INFO L226 Difference]: Without dead ends: 463 [2025-03-03 21:01:18,798 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-03 21:01:18,799 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:18,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-03 21:01:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2025-03-03 21:01:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 368 states have (on average 1.4320652173913044) internal successors, (527), 371 states have internal predecessors, (527), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 21:01:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 699 transitions. [2025-03-03 21:01:18,835 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 699 transitions. Word has length 188 [2025-03-03 21:01:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:18,836 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 699 transitions. [2025-03-03 21:01:18,836 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 699 transitions. [2025-03-03 21:01:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:01:18,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:18,839 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:18,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:01:18,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:18,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1816195593, now seen corresponding path program 1 times [2025-03-03 21:01:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497825070] [2025-03-03 21:01:18,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:18,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:01:18,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:01:18,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:18,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:01:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497825070] [2025-03-03 21:01:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497825070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:01:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092059193] [2025-03-03 21:01:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:01:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:18,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:01:18,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:01:18,916 INFO L87 Difference]: Start difference. First operand 463 states and 699 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:18,958 INFO L93 Difference]: Finished difference Result 653 states and 975 transitions. [2025-03-03 21:01:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:01:18,959 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2025-03-03 21:01:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:18,963 INFO L225 Difference]: With dead ends: 653 [2025-03-03 21:01:18,963 INFO L226 Difference]: Without dead ends: 297 [2025-03-03 21:01:18,966 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-03 21:01:18,967 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:18,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-03 21:01:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-03 21:01:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 218 states have (on average 1.3577981651376148) internal successors, (296), 219 states have internal predecessors, (296), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:01:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2025-03-03 21:01:19,001 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 436 transitions. Word has length 188 [2025-03-03 21:01:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:19,001 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 436 transitions. [2025-03-03 21:01:19,001 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:01:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 436 transitions. [2025-03-03 21:01:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:01:19,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:19,003 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:01:19,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -37624799, now seen corresponding path program 1 times [2025-03-03 21:01:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479180964] [2025-03-03 21:01:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:19,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:01:19,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:01:19,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:19,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:01:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479180964] [2025-03-03 21:01:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479180964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:01:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048929018] [2025-03-03 21:01:19,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:19,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:19,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:19,207 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-03 21:01:19,209 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-03 21:01:19,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:01:19,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:01:19,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:19,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:19,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:01:19,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-03 21:01:19,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:01:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:01:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048929018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:01:19,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:01:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 21:01:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133641783] [2025-03-03 21:01:19,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:01:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:01:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:19,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:01:19,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:01:19,725 INFO L87 Difference]: Start difference. First operand 297 states and 436 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-03 21:01:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:19,944 INFO L93 Difference]: Finished difference Result 527 states and 762 transitions. [2025-03-03 21:01:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:01:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 190 [2025-03-03 21:01:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:19,948 INFO L225 Difference]: With dead ends: 527 [2025-03-03 21:01:19,948 INFO L226 Difference]: Without dead ends: 311 [2025-03-03 21:01:19,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:01:19,950 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 145 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:19,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 253 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:01:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-03 21:01:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2025-03-03 21:01:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 223 states have (on average 1.295964125560538) internal successors, (289), 224 states have internal predecessors, (289), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:01:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 429 transitions. [2025-03-03 21:01:19,980 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 429 transitions. Word has length 190 [2025-03-03 21:01:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:19,980 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 429 transitions. [2025-03-03 21:01:19,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-03 21:01:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 429 transitions. [2025-03-03 21:01:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:01:19,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:19,982 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:19,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:01:20,183 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,SelfDestructingSolverStorable7 [2025-03-03 21:01:20,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -287244380, now seen corresponding path program 1 times [2025-03-03 21:01:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791380655] [2025-03-03 21:01:20,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:20,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:01:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:01:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:01:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791380655] [2025-03-03 21:01:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791380655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:01:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808550406] [2025-03-03 21:01:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:20,452 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-03 21:01:20,489 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-03 21:01:20,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:01:20,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:01:20,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:20,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:20,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:01:20,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-03 21:01:21,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:01:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:01:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808550406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:01:21,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:01:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-03 21:01:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74859571] [2025-03-03 21:01:21,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:01:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:01:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:21,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:01:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:01:21,359 INFO L87 Difference]: Start difference. First operand 305 states and 429 transitions. Second operand has 14 states, 14 states have (on average 10.428571428571429) internal successors, (146), 14 states have internal predecessors, (146), 6 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-03-03 21:01:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:21,970 INFO L93 Difference]: Finished difference Result 641 states and 909 transitions. [2025-03-03 21:01:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:01:21,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.428571428571429) internal successors, (146), 14 states have internal predecessors, (146), 6 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) Word has length 190 [2025-03-03 21:01:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:21,974 INFO L225 Difference]: With dead ends: 641 [2025-03-03 21:01:21,974 INFO L226 Difference]: Without dead ends: 443 [2025-03-03 21:01:21,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:01:21,975 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 268 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:21,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 576 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:01:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-03 21:01:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 309. [2025-03-03 21:01:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 227 states have (on average 1.2907488986784141) internal successors, (293), 228 states have internal predecessors, (293), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:01:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2025-03-03 21:01:22,000 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 190 [2025-03-03 21:01:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:22,000 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2025-03-03 21:01:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.428571428571429) internal successors, (146), 14 states have internal predecessors, (146), 6 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-03-03 21:01:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2025-03-03 21:01:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 21:01:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:22,002 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:22,010 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-03 21:01:22,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:22,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1607656715, now seen corresponding path program 1 times [2025-03-03 21:01:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:01:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386248918] [2025-03-03 21:01:22,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:01:22,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:01:22,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:01:22,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:01:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522427360] [2025-03-03 21:01:22,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:22,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:22,281 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-03 21:01:22,283 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-03 21:01:22,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:01:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:01:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:01:22,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:01:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:01:22,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:01:22,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:01:22,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:01:22,575 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:01:22,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:01:22,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:01:22,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:01:22,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:22,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:01:22,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:01:22 BoogieIcfgContainer [2025-03-03 21:01:22,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:01:22,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:01:22,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:01:22,916 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:01:22,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:01:14" (3/4) ... [2025-03-03 21:01:22,918 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:01:22,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:01:22,919 INFO L158 Benchmark]: Toolchain (without parser) took 9693.89ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.2MB in the beginning and 215.8MB in the end (delta: -103.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,920 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:01:22,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.40ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 90.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,920 INFO L158 Benchmark]: Boogie Preprocessor took 73.11ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 83.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:01:22,921 INFO L158 Benchmark]: IcfgBuilder took 617.07ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 48.1MB in the end (delta: 35.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,921 INFO L158 Benchmark]: TraceAbstraction took 8657.23ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 47.6MB in the beginning and 218.6MB in the end (delta: -171.0MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,921 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 268.4MB. Free memory was 218.6MB in the beginning and 215.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:01:22,923 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.40ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 90.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.11ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 83.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 617.07ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 48.1MB in the end (delta: 35.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8657.23ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 47.6MB in the beginning and 218.6MB in the end (delta: -171.0MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 268.4MB. Free memory was 218.6MB in the beginning and 215.8MB in the end (delta: 2.8MB). 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 someBinaryArithmeticDOUBLEoperation at line 105, overapproximation of someBinaryArithmeticDOUBLEoperation at line 101, overapproximation of bitwiseOr at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 183. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] signed long int var_1_26 = 500; [L43] float var_1_31 = 99.375; [L44] unsigned char var_1_34 = 8; [L45] signed long int var_1_36 = 1; [L46] double var_1_37 = 100.5; [L47] unsigned char var_1_40 = 0; [L48] unsigned char var_1_41 = 1; [L49] unsigned char var_1_42 = 1; [L50] unsigned char var_1_43 = 1; [L51] unsigned short int var_1_44 = 0; [L52] double var_1_46 = 1.75; [L53] unsigned short int last_1_var_1_8 = 8; [L54] unsigned char last_1_var_1_12 = 8; [L55] unsigned short int last_1_var_1_13 = 16; [L56] unsigned char last_1_var_1_17 = 0; [L57] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_8 = var_1_8 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_13 = var_1_13 [L179] last_1_var_1_17 = var_1_17 [L180] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=1, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L130] var_1_3 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L131] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L132] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] var_1_4 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L134] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L135] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] var_1_5 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L137] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L138] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L138] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L139] var_1_6 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L140] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L141] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L141] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L142] var_1_7 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L144] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L144] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L145] var_1_10 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L146] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L147] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L147] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L148] var_1_16 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L149] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L150] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L150] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L151] var_1_18 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L152] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L153] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L153] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L156] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L156] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L157] var_1_21 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L158] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L159] var_1_22 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L160] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L161] var_1_23 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L162] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L163] var_1_24 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L164] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L165] var_1_41 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L166] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L167] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L167] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L168] var_1_42 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_42 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L169] RET assume_abort_if_not(var_1_42 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L170] CALL assume_abort_if_not(var_1_42 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L170] RET assume_abort_if_not(var_1_42 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L171] var_1_43 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L172] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L173] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L173] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L191] RET updateVariables() [L192] CALL step() [L61] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L62] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L66] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=147455, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L67] COND TRUE last_1_var_1_13 == stepLocal_1 [L68] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L70] COND FALSE !(var_1_10 < var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L79] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L80] COND TRUE var_1_23 < var_1_24 [L81] var_1_40 = (! ((var_1_41 && var_1_42) && var_1_43)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L83] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L84] COND TRUE var_1_8 >= stepLocal_0 [L85] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L89] COND FALSE !(var_1_18 && (var_1_8 > (var_1_8 / var_1_6))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L94] EXPR 25 & var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L94] COND FALSE !((25 & var_1_7) < (var_1_7 - 25)) [L99] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=0, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L100] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L101] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=8, var_1_36=1, var_1_37=201/2, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L103] var_1_34 = var_1_6 [L104] var_1_36 = var_1_12 [L105] var_1_37 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L106] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L107] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L109] EXPR var_1_13 ^ var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=7/4, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L109] COND FALSE !(5u < (var_1_13 ^ var_1_16)) [L116] var_1_46 = var_1_24 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L118] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=147455, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L119] COND FALSE !(\read(var_1_17)) [L126] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L183] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L183] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L183-L184] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=147455, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_24=2, var_1_25=8, var_1_26=500, var_1_31=795/8, var_1_34=63, var_1_36=0, var_1_3=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=1, var_1_44=0, var_1_46=2, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1042 mSDsluCounter, 3220 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1902 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1318 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 228 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2639 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2623 ConstructedInterpolants, 0 QuantifiedInterpolants, 8319 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 20844/21168 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-03 21:01:22,950 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-pr-ci_file-21.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 6d6d2a27a426d678f634c04aba0efcc19886c221afd32b2e1f3bd78b6ab660f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:01:24,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:01:24,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:01:24,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:01:24,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:01:24,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:01:24,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:01:24,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:01:24,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:01:24,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:01:24,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:01:24,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:01:24,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:01:24,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:01:24,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:01:24,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:01:24,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:01:24,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:01:24,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:01:24,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:01:24,958 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 -> 6d6d2a27a426d678f634c04aba0efcc19886c221afd32b2e1f3bd78b6ab660f1 [2025-03-03 21:01:25,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:01:25,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:01:25,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:01:25,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:01:25,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:01:25,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:26,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a8492bb/74167eabe4614e9ca1d2f40a01b4ca54/FLAGff5048ad4 [2025-03-03 21:01:26,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:01:26,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:26,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a8492bb/74167eabe4614e9ca1d2f40a01b4ca54/FLAGff5048ad4 [2025-03-03 21:01:26,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a8492bb/74167eabe4614e9ca1d2f40a01b4ca54 [2025-03-03 21:01:26,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:01:26,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:01:26,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:01:26,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:01:26,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:01:26,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26, skipping insertion in model container [2025-03-03 21:01:26,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:01:26,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i[919,932] [2025-03-03 21:01:26,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:01:26,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:01:26,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i[919,932] [2025-03-03 21:01:26,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:01:26,900 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:01:26,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26 WrapperNode [2025-03-03 21:01:26,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:01:26,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:01:26,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:01:26,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:01:26,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,946 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-03 21:01:26,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:01:26,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:01:26,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:01:26,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:01:26,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,979 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:01:26,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:26,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:27,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:01:27,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:01:27,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:01:27,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:01:27,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (1/1) ... [2025-03-03 21:01:27,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:01:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:01:27,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:01:27,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:01:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:01:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:01:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:01:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:01:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:01:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:01:27,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:01:27,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:01:28,764 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:01:28,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:01:28,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:01:28,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:01:28,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:01:28 BoogieIcfgContainer [2025-03-03 21:01:28,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:01:28,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:01:28,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:01:28,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:01:28,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:01:26" (1/3) ... [2025-03-03 21:01:28,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade97eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:01:28, skipping insertion in model container [2025-03-03 21:01:28,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:01:26" (2/3) ... [2025-03-03 21:01:28,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade97eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:01:28, skipping insertion in model container [2025-03-03 21:01:28,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:01:28" (3/3) ... [2025-03-03 21:01:28,783 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-03 21:01:28,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:01:28,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:01:28,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:01:28,840 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;@4bb8a3f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:01:28,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:01:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:01:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 21:01:28,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:28,853 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:28,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:28,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash -641942253, now seen corresponding path program 1 times [2025-03-03 21:01:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:01:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168549223] [2025-03-03 21:01:28,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:28,865 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-03 21:01:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:01:28,867 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-03 21:01:28,869 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-03 21:01:28,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 21:01:29,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 21:01:29,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:29,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:01:29,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 21:01:29,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:01:29,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:01:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168549223] [2025-03-03 21:01:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168549223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:01:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087934740] [2025-03-03 21:01:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:01:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:01:29,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:01:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:01:29,294 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:29,319 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2025-03-03 21:01:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:01:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2025-03-03 21:01:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:29,327 INFO L225 Difference]: With dead ends: 163 [2025-03-03 21:01:29,328 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 21:01:29,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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-03 21:01:29,333 INFO L435 NwaCegarLoop]: 120 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, 120 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-03 21:01:29,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:01:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 21:01:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 21:01:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:01:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-03-03 21:01:29,367 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 182 [2025-03-03 21:01:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-03-03 21:01:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-03-03 21:01:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 21:01:29,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:29,372 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:29,383 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-03 21:01:29,572 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-03 21:01:29,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1307930127, now seen corresponding path program 1 times [2025-03-03 21:01:29,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:01:29,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839816003] [2025-03-03 21:01:29,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:29,574 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-03 21:01:29,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:01:29,577 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-03 21:01:29,578 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-03 21:01:29,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 21:01:29,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 21:01:29,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:29,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:01:29,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-03 21:01:30,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:01:30,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:01:30,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839816003] [2025-03-03 21:01:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839816003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:01:30,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [274605085] [2025-03-03 21:01:30,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:30,907 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:01:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:01:30,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:01:30,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 21:01:30,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 21:01:31,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 21:01:31,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:31,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:31,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:01:31,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-03 21:01:32,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:01:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [274605085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:01:32,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:01:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-03 21:01:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685747493] [2025-03-03 21:01:32,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:01:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:01:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:01:32,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:01:32,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:01:32,513 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:33,841 INFO L93 Difference]: Finished difference Result 234 states and 353 transitions. [2025-03-03 21:01:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:01:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2025-03-03 21:01:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:33,848 INFO L225 Difference]: With dead ends: 234 [2025-03-03 21:01:33,848 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 21:01:33,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:01:33,849 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:33,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:01:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 21:01:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2025-03-03 21:01:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 91 states have internal predecessors, (114), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:01:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2025-03-03 21:01:33,881 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 182 [2025-03-03 21:01:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:33,882 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2025-03-03 21:01:33,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:01:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2025-03-03 21:01:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 21:01:33,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:33,884 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:33,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 21:01:34,102 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 (3)] Ended with exit code 0 [2025-03-03 21:01:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /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-03 21:01:34,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 286565399, now seen corresponding path program 1 times [2025-03-03 21:01:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:01:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65422411] [2025-03-03 21:01:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:34,293 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-03 21:01:34,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:01:34,295 INFO L229 MonitoredProcess]: Starting monitored process 5 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-03 21:01:34,296 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 (5)] Waiting until timeout for monitored process [2025-03-03 21:01:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 21:01:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 21:01:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:34,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:01:34,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:01:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-03-03 21:01:34,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:01:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:01:34,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:01:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65422411] [2025-03-03 21:01:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65422411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:01:34,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:01:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 21:01:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052638457] [2025-03-03 21:01:34,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:01:34,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:01:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:01:34,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:01:34,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:01:34,998 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 21:01:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:36,299 INFO L93 Difference]: Finished difference Result 250 states and 365 transitions. [2025-03-03 21:01:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:01:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 183 [2025-03-03 21:01:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:36,315 INFO L225 Difference]: With dead ends: 250 [2025-03-03 21:01:36,315 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 21:01:36,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:01:36,316 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 109 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 189 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:01:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 21:01:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-03-03 21:01:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:01:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2025-03-03 21:01:36,342 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 183 [2025-03-03 21:01:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:36,343 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2025-03-03 21:01:36,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 21:01:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2025-03-03 21:01:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 21:01:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:36,345 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:36,357 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 (5)] Ended with exit code 0 [2025-03-03 21:01:36,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-03 21:01:36,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:36,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1174069080, now seen corresponding path program 1 times [2025-03-03 21:01:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:01:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798159817] [2025-03-03 21:01:36,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:36,546 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-03 21:01:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:01:36,548 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 21:01:36,549 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 (6)] Waiting until timeout for monitored process [2025-03-03 21:01:36,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 21:01:37,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 21:01:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:37,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 21:01:37,080 INFO L279 TraceCheckSpWp]: Computing forward predicates...