./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-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-?-e2fb8be-m [2025-03-08 12:12:42,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:12:42,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:12:42,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:12:42,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:12:42,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:12:42,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:12:42,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:12:42,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:12:42,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:12:42,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:12:42,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:12:42,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:12:42,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:12:42,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:12:42,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:12:42,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:12:42,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:12:42,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:42,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:12:42,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:12:42,457 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-08 12:12:42,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:12:42,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:12:42,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:12:42,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:12:42,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:12:42,712 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-08 12:12:43,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffee4f24/5669368505694003a1f8bbf78b75d548/FLAG72f0fbd6f [2025-03-08 12:12:44,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:12:44,149 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-08 12:12:44,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffee4f24/5669368505694003a1f8bbf78b75d548/FLAG72f0fbd6f [2025-03-08 12:12:44,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffee4f24/5669368505694003a1f8bbf78b75d548 [2025-03-08 12:12:44,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:12:44,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:12:44,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:44,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:12:44,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:12:44,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ad0ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44, skipping insertion in model container [2025-03-08 12:12:44,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:12:44,583 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-08 12:12:44,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:44,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:12:44,679 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-08 12:12:44,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:44,725 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:12:44,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44 WrapperNode [2025-03-08 12:12:44,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:44,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:44,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:12:44,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:12:44,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,772 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 264 [2025-03-08 12:12:44,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:44,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:12:44,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:12:44,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:12:44,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:12:44,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:12:44,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:12:44,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:12:44,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:12:44,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (1/1) ... [2025-03-08 12:12:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:44,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:12:44,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:12:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:12:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:12:44,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:12:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:12:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:12:44,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:12:44,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:12:44,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:12:45,307 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1; [2025-03-08 12:12:45,338 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 12:12:45,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:12:45,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:12:45,355 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:12:45,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:45 BoogieIcfgContainer [2025-03-08 12:12:45,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:12:45,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:12:45,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:12:45,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:12:45,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:12:44" (1/3) ... [2025-03-08 12:12:45,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582afa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:45, skipping insertion in model container [2025-03-08 12:12:45,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:44" (2/3) ... [2025-03-08 12:12:45,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582afa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:45, skipping insertion in model container [2025-03-08 12:12:45,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:45" (3/3) ... [2025-03-08 12:12:45,362 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-08 12:12:45,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:12:45,373 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-08 12:12:45,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:12:45,433 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;@5bfff7fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:12:45,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:12:45,436 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-08 12:12:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 12:12:45,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:45,451 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-08 12:12:45,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1389047086, now seen corresponding path program 1 times [2025-03-08 12:12:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:45,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456621573] [2025-03-08 12:12:45,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 12:12:45,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 12:12:45,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:45,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:45,765 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-08 12:12:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456621573] [2025-03-08 12:12:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456621573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076258303] [2025-03-08 12:12:45,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:45,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:45,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:45,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:45,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:12:45,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 12:12:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 12:12:45,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:45,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:12:45,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:45,913 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-08 12:12:45,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:12:45,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076258303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:45,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:12:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:12:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335407387] [2025-03-08 12:12:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:12:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:45,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:12:45,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:12:45,938 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-08 12:12:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:45,972 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2025-03-08 12:12:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:12:45,974 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-08 12:12:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:45,979 INFO L225 Difference]: With dead ends: 211 [2025-03-08 12:12:45,980 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 12:12:45,982 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-08 12:12:45,986 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-08 12:12:45,986 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-08 12:12:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 12:12:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 12:12:46,020 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-08 12:12:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2025-03-08 12:12:46,030 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 186 [2025-03-08 12:12:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:46,031 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2025-03-08 12:12:46,032 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-08 12:12:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2025-03-08 12:12:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 12:12:46,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:46,037 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-08 12:12:46,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:12:46,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:12:46,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:46,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash 57976270, now seen corresponding path program 1 times [2025-03-08 12:12:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833269142] [2025-03-08 12:12:46,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:46,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 12:12:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 12:12:46,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:46,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:46,644 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-08 12:12:46,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833269142] [2025-03-08 12:12:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833269142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:46,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:46,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:12:46,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760406625] [2025-03-08 12:12:46,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:12:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:46,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:12:46,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:46,649 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-08 12:12:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:46,725 INFO L93 Difference]: Finished difference Result 293 states and 455 transitions. [2025-03-08 12:12:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:12:46,726 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-08 12:12:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:46,729 INFO L225 Difference]: With dead ends: 293 [2025-03-08 12:12:46,730 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 12:12:46,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:46,732 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-08 12:12:46,732 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-08 12:12:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 12:12:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2025-03-08 12:12:46,750 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-08 12:12:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 281 transitions. [2025-03-08 12:12:46,751 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 281 transitions. Word has length 186 [2025-03-08 12:12:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:46,753 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 281 transitions. [2025-03-08 12:12:46,753 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-08 12:12:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 281 transitions. [2025-03-08 12:12:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 12:12:46,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:46,755 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-08 12:12:46,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:12:46,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:46,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash -78203283, now seen corresponding path program 1 times [2025-03-08 12:12:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:46,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395049259] [2025-03-08 12:12:46,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:46,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 12:12:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 12:12:46,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:46,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:47,101 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-08 12:12:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395049259] [2025-03-08 12:12:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395049259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:12:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667561650] [2025-03-08 12:12:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:12:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:47,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:12:47,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:12:47,108 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-08 12:12:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:47,193 INFO L93 Difference]: Finished difference Result 294 states and 456 transitions. [2025-03-08 12:12:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:12:47,193 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-08 12:12:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:47,195 INFO L225 Difference]: With dead ends: 294 [2025-03-08 12:12:47,197 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 12:12:47,198 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-08 12:12:47,199 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-08 12:12:47,200 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-08 12:12:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 12:12:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2025-03-08 12:12:47,228 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-08 12:12:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 284 transitions. [2025-03-08 12:12:47,231 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 284 transitions. Word has length 187 [2025-03-08 12:12:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:47,233 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 284 transitions. [2025-03-08 12:12:47,233 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-08 12:12:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 284 transitions. [2025-03-08 12:12:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 12:12:47,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:47,237 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-08 12:12:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:12:47,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:47,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1405892103, now seen corresponding path program 1 times [2025-03-08 12:12:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807208695] [2025-03-08 12:12:47,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:47,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 12:12:47,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 12:12:47,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:47,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:47,510 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-08 12:12:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807208695] [2025-03-08 12:12:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807208695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:12:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501995208] [2025-03-08 12:12:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:12:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:12:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:12:47,512 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-08 12:12:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:47,673 INFO L93 Difference]: Finished difference Result 422 states and 642 transitions. [2025-03-08 12:12:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:12:47,674 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-08 12:12:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:47,690 INFO L225 Difference]: With dead ends: 422 [2025-03-08 12:12:47,690 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 12:12:47,690 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-08 12:12:47,691 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-08 12:12:47,691 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-08 12:12:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 12:12:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2025-03-08 12:12:47,713 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-08 12:12:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2025-03-08 12:12:47,715 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 188 [2025-03-08 12:12:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2025-03-08 12:12:47,717 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-08 12:12:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2025-03-08 12:12:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 12:12:47,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:47,719 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-08 12:12:47,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:12:47,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -401562360, now seen corresponding path program 1 times [2025-03-08 12:12:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109783901] [2025-03-08 12:12:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 12:12:47,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 12:12:47,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:47,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:48,934 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-08 12:12:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109783901] [2025-03-08 12:12:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109783901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:12:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943003808] [2025-03-08 12:12:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:12:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:48,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:12:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:12:48,936 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-08 12:12:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:49,370 INFO L93 Difference]: Finished difference Result 777 states and 1189 transitions. [2025-03-08 12:12:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:12:49,370 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-08 12:12:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:49,374 INFO L225 Difference]: With dead ends: 777 [2025-03-08 12:12:49,374 INFO L226 Difference]: Without dead ends: 603 [2025-03-08 12:12:49,375 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-08 12:12:49,376 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-08 12:12:49,376 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-08 12:12:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-08 12:12:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 574. [2025-03-08 12:12:49,417 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-08 12:12:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 885 transitions. [2025-03-08 12:12:49,420 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 885 transitions. Word has length 188 [2025-03-08 12:12:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:49,421 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 885 transitions. [2025-03-08 12:12:49,421 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-08 12:12:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 885 transitions. [2025-03-08 12:12:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 12:12:49,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:49,423 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-08 12:12:49,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:12:49,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:49,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -810386585, now seen corresponding path program 1 times [2025-03-08 12:12:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401932044] [2025-03-08 12:12:49,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:49,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 12:12:49,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 12:12:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:49,511 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-08 12:12:49,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:49,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401932044] [2025-03-08 12:12:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401932044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:12:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50610549] [2025-03-08 12:12:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:49,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:12:49,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:49,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:12:49,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:49,513 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-08 12:12:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:49,556 INFO L93 Difference]: Finished difference Result 925 states and 1418 transitions. [2025-03-08 12:12:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:12:49,557 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-08 12:12:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:49,560 INFO L225 Difference]: With dead ends: 925 [2025-03-08 12:12:49,562 INFO L226 Difference]: Without dead ends: 463 [2025-03-08 12:12:49,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:49,563 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-08 12:12:49,564 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-08 12:12:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-08 12:12:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2025-03-08 12:12:49,598 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-08 12:12:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 699 transitions. [2025-03-08 12:12:49,601 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 699 transitions. Word has length 188 [2025-03-08 12:12:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:49,602 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 699 transitions. [2025-03-08 12:12:49,602 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-08 12:12:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 699 transitions. [2025-03-08 12:12:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 12:12:49,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:49,604 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-08 12:12:49,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:12:49,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1816195593, now seen corresponding path program 1 times [2025-03-08 12:12:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:49,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035112137] [2025-03-08 12:12:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:49,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 12:12:49,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 12:12:49,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:49,678 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-08 12:12:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:49,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035112137] [2025-03-08 12:12:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035112137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:12:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604062874] [2025-03-08 12:12:49,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:12:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:49,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:12:49,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:49,680 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-08 12:12:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:49,724 INFO L93 Difference]: Finished difference Result 653 states and 975 transitions. [2025-03-08 12:12:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:12:49,724 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-08 12:12:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:49,726 INFO L225 Difference]: With dead ends: 653 [2025-03-08 12:12:49,726 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 12:12:49,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:49,731 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-08 12:12:49,731 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-08 12:12:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 12:12:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-08 12:12:49,763 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-08 12:12:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2025-03-08 12:12:49,765 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 436 transitions. Word has length 188 [2025-03-08 12:12:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:49,767 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 436 transitions. [2025-03-08 12:12:49,767 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-08 12:12:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 436 transitions. [2025-03-08 12:12:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:12:49,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:49,770 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-08 12:12:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:12:49,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash -37624799, now seen corresponding path program 1 times [2025-03-08 12:12:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973732043] [2025-03-08 12:12:49,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:49,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:12:49,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:12:49,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:49,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:49,944 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-08 12:12:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973732043] [2025-03-08 12:12:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973732043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433436400] [2025-03-08 12:12:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:49,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:49,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:49,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:12:50,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:12:50,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:12:50,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:50,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:50,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:12:50,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:50,289 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-08 12:12:50,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:12:50,509 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-08 12:12:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433436400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:12:50,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:12:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 12:12:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112601678] [2025-03-08 12:12:50,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:12:50,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:12:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:50,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:12:50,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:12:50,511 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-08 12:12:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:50,718 INFO L93 Difference]: Finished difference Result 527 states and 762 transitions. [2025-03-08 12:12:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:12:50,718 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-08 12:12:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:50,720 INFO L225 Difference]: With dead ends: 527 [2025-03-08 12:12:50,720 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 12:12:50,721 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-08 12:12:50,721 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-08 12:12:50,721 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-08 12:12:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 12:12:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2025-03-08 12:12:50,745 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-08 12:12:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 429 transitions. [2025-03-08 12:12:50,747 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 429 transitions. Word has length 190 [2025-03-08 12:12:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 429 transitions. [2025-03-08 12:12:50,748 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-08 12:12:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 429 transitions. [2025-03-08 12:12:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:12:50,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:50,751 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-08 12:12:50,758 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-08 12:12:50,952 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-08 12:12:50,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:50,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -287244380, now seen corresponding path program 1 times [2025-03-08 12:12:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:50,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510615108] [2025-03-08 12:12:50,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:50,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:12:50,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:12:50,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:50,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:51,200 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-08 12:12:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510615108] [2025-03-08 12:12:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510615108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614402352] [2025-03-08 12:12:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:51,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:51,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:12:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:12:51,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:12:51,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:51,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:51,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:12:51,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:51,783 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-08 12:12:51,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:12:52,127 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-08 12:12:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614402352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:12:52,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:12:52,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-08 12:12:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243221792] [2025-03-08 12:12:52,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:12:52,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 12:12:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:52,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 12:12:52,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:12:52,130 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-08 12:12:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:52,707 INFO L93 Difference]: Finished difference Result 641 states and 909 transitions. [2025-03-08 12:12:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:12:52,708 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-08 12:12:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:52,710 INFO L225 Difference]: With dead ends: 641 [2025-03-08 12:12:52,710 INFO L226 Difference]: Without dead ends: 443 [2025-03-08 12:12:52,711 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-08 12:12:52,712 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-08 12:12:52,712 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-08 12:12:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-08 12:12:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 309. [2025-03-08 12:12:52,735 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-08 12:12:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2025-03-08 12:12:52,737 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 190 [2025-03-08 12:12:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2025-03-08 12:12:52,738 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-08 12:12:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2025-03-08 12:12:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 12:12:52,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:52,740 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-08 12:12:52,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:12:52,944 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-08 12:12:52,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1607656715, now seen corresponding path program 1 times [2025-03-08 12:12:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262216525] [2025-03-08 12:12:52,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 12:12:53,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 12:12:53,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:53,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:12:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550556358] [2025-03-08 12:12:53,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:53,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:53,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:53,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 12:12:53,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 12:12:53,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 12:12:53,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:12:53,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:12:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 12:12:53,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 12:12:53,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:53,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:12:53,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:12:53,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:12:53,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:12:53,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 12:12:53,536 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-08 12:12:53,539 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:53,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:12:53,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:12:53 BoogieIcfgContainer [2025-03-08 12:12:53,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:12:53,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:12:53,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:12:53,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:12:53,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:45" (3/4) ... [2025-03-08 12:12:53,650 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:12:53,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:12:53,651 INFO L158 Benchmark]: Toolchain (without parser) took 9184.56ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.3MB in the beginning and 205.4MB in the end (delta: -83.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2025-03-08 12:12:53,651 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:53,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.13ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 105.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:12:53,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.26ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 100.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:53,652 INFO L158 Benchmark]: Boogie Preprocessor took 48.27ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 93.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:12:53,653 INFO L158 Benchmark]: IcfgBuilder took 529.79ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 58.0MB in the end (delta: 35.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 12:12:53,653 INFO L158 Benchmark]: TraceAbstraction took 8290.14ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 57.6MB in the beginning and 205.5MB in the end (delta: -147.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:53,653 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 293.6MB. Free memory was 205.5MB in the beginning and 205.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:53,654 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.73ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.13ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 105.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.26ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 100.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.27ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 93.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 529.79ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 58.0MB in the end (delta: 35.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8290.14ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 57.6MB in the beginning and 205.5MB in the end (delta: -147.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 293.6MB. Free memory was 205.5MB in the beginning and 205.4MB in the end (delta: 92.3kB). There was no memory consumed. 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 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 164. 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, 199 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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, 3.9s 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-08 12:12:53,683 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-?-e2fb8be-m [2025-03-08 12:12:55,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:12:55,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:12:55,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:12:55,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:12:55,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:12:55,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:12:55,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:12:55,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:12:55,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:12:55,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:12:55,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:12:55,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:12:55,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:12:55,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:12:55,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:12:55,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:55,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:12:55,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:12:55,635 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-08 12:12:55,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:12:55,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:12:55,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:12:55,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:12:55,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:12:55,897 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-08 12:12:57,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b533976/758f347782ec43c0820975736e04bd91/FLAG719249360 [2025-03-08 12:12:57,263 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:12:57,263 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-08 12:12:57,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b533976/758f347782ec43c0820975736e04bd91/FLAG719249360 [2025-03-08 12:12:57,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b533976/758f347782ec43c0820975736e04bd91 [2025-03-08 12:12:57,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:12:57,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:12:57,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:57,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:12:57,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:12:57,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2076fad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57, skipping insertion in model container [2025-03-08 12:12:57,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:12:57,748 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-08 12:12:57,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:57,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:12:57,846 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-08 12:12:57,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:57,908 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:12:57,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57 WrapperNode [2025-03-08 12:12:57,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:57,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:57,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:12:57,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:12:57,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,953 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-08 12:12:57,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:57,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:12:57,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:12:57,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:12:57,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,985 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:12:57,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:57,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:58,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:12:58,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:12:58,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:12:58,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:12:58,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (1/1) ... [2025-03-08 12:12:58,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:58,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:12:58,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-08 12:12:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:12:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:12:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:12:58,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:12:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:12:58,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:12:58,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:12:58,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:12:59,540 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:12:59,540 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:12:59,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:12:59,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:12:59,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:59 BoogieIcfgContainer [2025-03-08 12:12:59,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:12:59,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:12:59,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:12:59,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:12:59,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:12:57" (1/3) ... [2025-03-08 12:12:59,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cc5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:59, skipping insertion in model container [2025-03-08 12:12:59,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:57" (2/3) ... [2025-03-08 12:12:59,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cc5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:59, skipping insertion in model container [2025-03-08 12:12:59,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:59" (3/3) ... [2025-03-08 12:12:59,557 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-21.i [2025-03-08 12:12:59,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:12:59,567 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-08 12:12:59,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:12:59,615 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;@7cb9595c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:12:59,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:12:59,619 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-08 12:12:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 12:12:59,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:59,630 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-08 12:12:59,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -641942253, now seen corresponding path program 1 times [2025-03-08 12:12:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505058804] [2025-03-08 12:12:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:59,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:59,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:12:59,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 12:12:59,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 12:12:59,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:59,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:59,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:13:00,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:13:00,034 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-08 12:13:00,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:13:00,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:13:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505058804] [2025-03-08 12:13:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505058804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:13:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:13:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:13:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144165179] [2025-03-08 12:13:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:13:00,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:13:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:13:00,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:13:00,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:13:00,060 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-08 12:13:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:13:00,087 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2025-03-08 12:13:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:13:00,089 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-08 12:13:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:13:00,094 INFO L225 Difference]: With dead ends: 163 [2025-03-08 12:13:00,094 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 12:13:00,097 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-08 12:13:00,099 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-08 12:13:00,099 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-08 12:13:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 12:13:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 12:13:00,133 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-08 12:13:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-03-08 12:13:00,141 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 182 [2025-03-08 12:13:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:13:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-03-08 12:13:00,141 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-08 12:13:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-03-08 12:13:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 12:13:00,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:13:00,144 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-08 12:13:00,157 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 12:13:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:13:00,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:13:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:13:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1307930127, now seen corresponding path program 1 times [2025-03-08 12:13:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:13:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664057081] [2025-03-08 12:13:00,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:13:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:13:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:13:00,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:13:00,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:13:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 12:13:00,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 12:13:00,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:13:00,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:13:00,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:13:00,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:13:01,565 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-08 12:13:01,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:13:01,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:13:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664057081] [2025-03-08 12:13:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664057081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:13:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1992922714] [2025-03-08 12:13:01,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:13:01,796 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:13:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:13:01,798 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-08 12:13:01,800 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-08 12:13:01,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 12:13:02,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 12:13:02,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:13:02,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:13:02,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:13:02,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:13:03,284 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-08 12:13:03,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:13:03,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1992922714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:13:03,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:13:03,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 12:13:03,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274605085] [2025-03-08 12:13:03,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:13:03,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:13:03,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:13:03,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:13:03,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:13:03,485 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-08 12:13:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:13:04,849 INFO L93 Difference]: Finished difference Result 234 states and 353 transitions. [2025-03-08 12:13:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:13:04,850 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-08 12:13:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:13:04,852 INFO L225 Difference]: With dead ends: 234 [2025-03-08 12:13:04,852 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 12:13:04,853 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-08 12:13:04,854 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:13:04,854 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.3s Time] [2025-03-08 12:13:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 12:13:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2025-03-08 12:13:04,880 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-08 12:13:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2025-03-08 12:13:04,882 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 182 [2025-03-08 12:13:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:13:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2025-03-08 12:13:04,883 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-08 12:13:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2025-03-08 12:13:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 12:13:04,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:13:04,885 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-08 12:13:04,894 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-08 12:13:05,095 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-08 12:13:05,285 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-08 12:13:05,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:13:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:13:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 286565399, now seen corresponding path program 1 times [2025-03-08 12:13:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:13:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027652898] [2025-03-08 12:13:05,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:13:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:13:05,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:13:05,290 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-08 12:13:05,291 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-08 12:13:05,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 12:13:05,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 12:13:05,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:13:05,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:13:05,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:13:05,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:13:05,761 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-08 12:13:05,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:13:06,009 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-08 12:13:06,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:13:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027652898] [2025-03-08 12:13:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027652898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:13:06,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:13:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:13:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746902175] [2025-03-08 12:13:06,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:13:06,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:13:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:13:06,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:13:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:13:06,011 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-08 12:13:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:13:07,342 INFO L93 Difference]: Finished difference Result 250 states and 365 transitions. [2025-03-08 12:13:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:13:07,356 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-08 12:13:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:13:07,359 INFO L225 Difference]: With dead ends: 250 [2025-03-08 12:13:07,360 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 12:13:07,361 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-08 12:13:07,363 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:13:07,363 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.3s Time] [2025-03-08 12:13:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 12:13:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-03-08 12:13:07,377 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-08 12:13:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2025-03-08 12:13:07,378 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 183 [2025-03-08 12:13:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:13:07,379 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2025-03-08 12:13:07,379 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-08 12:13:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2025-03-08 12:13:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 12:13:07,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:13:07,381 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-08 12:13:07,395 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-08 12:13:07,581 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-08 12:13:07,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:13:07,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:13:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1174069080, now seen corresponding path program 1 times [2025-03-08 12:13:07,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:13:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777332449] [2025-03-08 12:13:07,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:13:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:13:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:13:07,585 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-08 12:13:07,586 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-08 12:13:07,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 12:13:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 12:13:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:13:08,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:13:08,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 12:13:08,133 INFO L279 TraceCheckSpWp]: Computing forward predicates...