./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.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 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:00:00,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:00:00,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:00:00,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:00:00,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:00:00,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:00:00,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:00:00,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:00:00,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:00:00,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:00:00,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:00:00,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:00:00,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:00:00,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:00:00,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:00:00,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:00:00,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:00,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:00:00,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:00:00,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:00:00,717 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 -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2025-03-04 00:00:00,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:00:00,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:00:00,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:00:00,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:00:00,973 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:00:00,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:02,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86ff3a2/11bdb2cc350e4440988c7e89473c7d47/FLAG022b3cf48 [2025-03-04 00:00:02,492 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:00:02,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:02,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86ff3a2/11bdb2cc350e4440988c7e89473c7d47/FLAG022b3cf48 [2025-03-04 00:00:02,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86ff3a2/11bdb2cc350e4440988c7e89473c7d47 [2025-03-04 00:00:02,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:00:02,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:00:02,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:02,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:00:02,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:00:02,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:02" (1/1) ... [2025-03-04 00:00:02,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fea6ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:02, skipping insertion in model container [2025-03-04 00:00:02,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:02" (1/1) ... [2025-03-04 00:00:02,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:00:02,893 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_operatoramount_amount100_file-80.i[916,929] [2025-03-04 00:00:02,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:02,968 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:00:02,976 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_operatoramount_amount100_file-80.i[916,929] [2025-03-04 00:00:03,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:03,018 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:00:03,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03 WrapperNode [2025-03-04 00:00:03,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:03,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:03,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:00:03,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:00:03,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,074 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2025-03-04 00:00:03,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:03,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:00:03,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:00:03,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:00:03,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,105 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-04 00:00:03,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:00:03,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:00:03,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:00:03,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:00:03,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (1/1) ... [2025-03-04 00:00:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:03,162 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-04 00:00:03,166 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-04 00:00:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:00:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:00:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:00:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:00:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:00:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:00:03,260 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:00:03,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:00:03,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~ite21#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-03-04 00:00:03,983 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-04 00:00:03,987 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:00:04,019 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:00:04,024 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:00:04,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:04 BoogieIcfgContainer [2025-03-04 00:00:04,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:00:04,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:00:04,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:00:04,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:00:04,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:00:02" (1/3) ... [2025-03-04 00:00:04,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a3e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:04, skipping insertion in model container [2025-03-04 00:00:04,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:03" (2/3) ... [2025-03-04 00:00:04,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a3e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:04, skipping insertion in model container [2025-03-04 00:00:04,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:04" (3/3) ... [2025-03-04 00:00:04,044 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:04,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:00:04,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-80.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:00:04,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:00:04,191 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;@23f29186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:00:04,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:00:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 00:00:04,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:04,206 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:04,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 419042956, now seen corresponding path program 1 times [2025-03-04 00:00:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114028769] [2025-03-04 00:00:04,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:04,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 00:00:04,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 00:00:04,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:04,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:00:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:04,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114028769] [2025-03-04 00:00:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114028769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:00:04,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139736520] [2025-03-04 00:00:04,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:04,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:04,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:04,870 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-04 00:00:04,873 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-04 00:00:05,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 00:00:05,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 00:00:05,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:05,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:00:05,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:00:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:00:05,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:00:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139736520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:05,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:00:05,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:00:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346055203] [2025-03-04 00:00:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:05,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:00:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:05,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:00:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:00:05,331 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:05,381 INFO L93 Difference]: Finished difference Result 198 states and 334 transitions. [2025-03-04 00:00:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:00:05,388 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2025-03-04 00:00:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:05,406 INFO L225 Difference]: With dead ends: 198 [2025-03-04 00:00:05,406 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 00:00:05,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-04 00:00:05,428 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:05,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:00:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 00:00:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 00:00:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2025-03-04 00:00:05,498 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2025-03-04 00:00:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2025-03-04 00:00:05,500 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2025-03-04 00:00:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 00:00:05,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:05,509 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:05,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:00:05,710 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-04 00:00:05,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1504721351, now seen corresponding path program 1 times [2025-03-04 00:00:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:05,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898927772] [2025-03-04 00:00:05,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 00:00:05,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 00:00:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898927772] [2025-03-04 00:00:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898927772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:00:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778753915] [2025-03-04 00:00:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:00:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:00:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:00:06,264 INFO L87 Difference]: Start difference. First operand 99 states and 153 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:06,393 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2025-03-04 00:00:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:00:06,394 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2025-03-04 00:00:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:06,400 INFO L225 Difference]: With dead ends: 245 [2025-03-04 00:00:06,401 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 00:00:06,402 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-04 00:00:06,404 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:06,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:00:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 00:00:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-03-04 00:00:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:00:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2025-03-04 00:00:06,446 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2025-03-04 00:00:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:06,446 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2025-03-04 00:00:06,447 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2025-03-04 00:00:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 00:00:06,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:06,450 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:00:06,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1944521255, now seen corresponding path program 1 times [2025-03-04 00:00:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894888085] [2025-03-04 00:00:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:06,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 00:00:06,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 00:00:06,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:06,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894888085] [2025-03-04 00:00:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894888085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:07,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:07,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:00:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853165067] [2025-03-04 00:00:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:00:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:07,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:00:07,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:00:07,778 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:08,462 INFO L93 Difference]: Finished difference Result 578 states and 879 transitions. [2025-03-04 00:00:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:00:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2025-03-04 00:00:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:08,466 INFO L225 Difference]: With dead ends: 578 [2025-03-04 00:00:08,468 INFO L226 Difference]: Without dead ends: 435 [2025-03-04 00:00:08,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:00:08,471 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 503 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:08,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 890 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:00:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-04 00:00:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 231. [2025-03-04 00:00:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 178 states have (on average 1.4325842696629214) internal successors, (255), 179 states have internal predecessors, (255), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 00:00:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2025-03-04 00:00:08,513 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 162 [2025-03-04 00:00:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2025-03-04 00:00:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2025-03-04 00:00:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 00:00:08,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:08,519 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:00:08,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:08,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2095709496, now seen corresponding path program 1 times [2025-03-04 00:00:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145640451] [2025-03-04 00:00:08,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 00:00:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 00:00:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:09,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145640451] [2025-03-04 00:00:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145640451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:00:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152262902] [2025-03-04 00:00:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:00:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:09,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:00:09,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:00:09,130 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:09,978 INFO L93 Difference]: Finished difference Result 586 states and 891 transitions. [2025-03-04 00:00:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:00:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-04 00:00:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:09,982 INFO L225 Difference]: With dead ends: 586 [2025-03-04 00:00:09,982 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 00:00:09,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:00:09,983 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 370 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:09,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 929 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:00:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 00:00:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 231. [2025-03-04 00:00:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 178 states have (on average 1.4325842696629214) internal successors, (255), 179 states have internal predecessors, (255), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 00:00:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2025-03-04 00:00:10,017 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 162 [2025-03-04 00:00:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:10,018 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2025-03-04 00:00:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2025-03-04 00:00:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 00:00:10,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:10,020 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:10,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:00:10,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 739794652, now seen corresponding path program 1 times [2025-03-04 00:00:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807948030] [2025-03-04 00:00:10,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:10,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807948030] [2025-03-04 00:00:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807948030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:00:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619317143] [2025-03-04 00:00:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:00:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:00:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:00:10,601 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:11,235 INFO L93 Difference]: Finished difference Result 686 states and 1044 transitions. [2025-03-04 00:00:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:00:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2025-03-04 00:00:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:11,239 INFO L225 Difference]: With dead ends: 686 [2025-03-04 00:00:11,239 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 00:00:11,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:00:11,241 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 556 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:11,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 866 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:00:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 00:00:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 303. [2025-03-04 00:00:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 250 states have (on average 1.472) internal successors, (368), 251 states have internal predecessors, (368), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 00:00:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2025-03-04 00:00:11,266 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 163 [2025-03-04 00:00:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:11,267 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2025-03-04 00:00:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2025-03-04 00:00:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 00:00:11,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:11,269 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:11,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:00:11,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:11,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1893554752, now seen corresponding path program 1 times [2025-03-04 00:00:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:11,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092069434] [2025-03-04 00:00:11,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:11,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:11,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:11,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092069434] [2025-03-04 00:00:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092069434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:00:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100881106] [2025-03-04 00:00:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:00:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:11,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:00:11,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:00:11,610 INFO L87 Difference]: Start difference. First operand 303 states and 464 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:12,166 INFO L93 Difference]: Finished difference Result 779 states and 1184 transitions. [2025-03-04 00:00:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:00:12,167 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2025-03-04 00:00:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:12,172 INFO L225 Difference]: With dead ends: 779 [2025-03-04 00:00:12,173 INFO L226 Difference]: Without dead ends: 601 [2025-03-04 00:00:12,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:00:12,174 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 242 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:12,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 523 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:00:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-04 00:00:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 343. [2025-03-04 00:00:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 290 states have (on average 1.4827586206896552) internal successors, (430), 291 states have internal predecessors, (430), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 00:00:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2025-03-04 00:00:12,212 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 163 [2025-03-04 00:00:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:12,212 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2025-03-04 00:00:12,213 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2025-03-04 00:00:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 00:00:12,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:12,214 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:00:12,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:12,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1337414691, now seen corresponding path program 1 times [2025-03-04 00:00:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446483543] [2025-03-04 00:00:12,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:12,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:12,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:12,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:00:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446483543] [2025-03-04 00:00:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446483543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:00:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537680147] [2025-03-04 00:00:12,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:12,379 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-04 00:00:12,381 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-04 00:00:12,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:12,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:12,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:12,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:00:12,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:00:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-04 00:00:12,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:00:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:00:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537680147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:00:13,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:00:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:00:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404908914] [2025-03-04 00:00:13,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:00:13,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:00:13,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:13,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:00:13,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:00:13,034 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:00:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:13,198 INFO L93 Difference]: Finished difference Result 638 states and 972 transitions. [2025-03-04 00:00:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:00:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2025-03-04 00:00:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:13,202 INFO L225 Difference]: With dead ends: 638 [2025-03-04 00:00:13,202 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 00:00:13,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:00:13,203 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:13,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 302 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:00:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 00:00:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2025-03-04 00:00:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 293 states have (on average 1.4334470989761092) internal successors, (420), 294 states have internal predecessors, (420), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 00:00:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 516 transitions. [2025-03-04 00:00:13,225 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 516 transitions. Word has length 163 [2025-03-04 00:00:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:13,225 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 516 transitions. [2025-03-04 00:00:13,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-04 00:00:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 516 transitions. [2025-03-04 00:00:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 00:00:13,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:13,228 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:13,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:00:13,429 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,SelfDestructingSolverStorable6 [2025-03-04 00:00:13,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:13,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1277263637, now seen corresponding path program 1 times [2025-03-04 00:00:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528948852] [2025-03-04 00:00:13,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:13,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:13,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:13,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:13,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:00:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528948852] [2025-03-04 00:00:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528948852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:00:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673300382] [2025-03-04 00:00:13,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:13,624 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-04 00:00:13,640 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-04 00:00:13,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 00:00:13,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 00:00:13,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:13,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:13,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:00:13,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:00:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-04 00:00:14,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:00:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:00:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673300382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:00:14,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:00:14,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:00:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131359920] [2025-03-04 00:00:14,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:00:14,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:00:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:14,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:00:14,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:00:14,484 INFO L87 Difference]: Start difference. First operand 348 states and 516 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:00:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:14,711 INFO L93 Difference]: Finished difference Result 542 states and 791 transitions. [2025-03-04 00:00:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:00:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 163 [2025-03-04 00:00:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:14,713 INFO L225 Difference]: With dead ends: 542 [2025-03-04 00:00:14,713 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 00:00:14,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:00:14,714 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 161 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:14,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 275 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:00:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 00:00:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2025-03-04 00:00:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 194 states have (on average 1.3350515463917525) internal successors, (259), 194 states have internal predecessors, (259), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:00:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 351 transitions. [2025-03-04 00:00:14,759 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 351 transitions. Word has length 163 [2025-03-04 00:00:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:14,763 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 351 transitions. [2025-03-04 00:00:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-04 00:00:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 351 transitions. [2025-03-04 00:00:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 00:00:14,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:14,764 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:14,794 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-04 00:00:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:14,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -277082499, now seen corresponding path program 1 times [2025-03-04 00:00:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801206356] [2025-03-04 00:00:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:14,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:00:15,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:00:15,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:15,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801206356] [2025-03-04 00:00:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801206356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:00:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246496949] [2025-03-04 00:00:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:15,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:00:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:15,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:00:15,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:00:15,442 INFO L87 Difference]: Start difference. First operand 249 states and 351 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:15,487 INFO L93 Difference]: Finished difference Result 411 states and 585 transitions. [2025-03-04 00:00:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:00:15,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2025-03-04 00:00:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:15,490 INFO L225 Difference]: With dead ends: 411 [2025-03-04 00:00:15,490 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 00:00:15,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-04 00:00:15,494 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:15,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:00:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 00:00:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 249. [2025-03-04 00:00:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 194 states have (on average 1.309278350515464) internal successors, (254), 194 states have internal predecessors, (254), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:00:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 346 transitions. [2025-03-04 00:00:15,536 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 346 transitions. Word has length 165 [2025-03-04 00:00:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 346 transitions. [2025-03-04 00:00:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 346 transitions. [2025-03-04 00:00:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 00:00:15,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:15,546 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:15,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:00:15,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash 719989854, now seen corresponding path program 1 times [2025-03-04 00:00:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209983775] [2025-03-04 00:00:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:15,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:00:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:00:15,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:15,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:00:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693445025] [2025-03-04 00:00:15,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:15,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:15,689 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-04 00:00:15,691 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-04 00:00:15,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:00:15,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:00:15,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:15,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:00:15,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:00:15,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:00:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:00:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:00:15,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:00:15,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:00:15,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:00:15,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:00:16,194 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-04 00:00:16,196 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:16,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:00:16,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:00:16 BoogieIcfgContainer [2025-03-04 00:00:16,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:00:16,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:00:16,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:00:16,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:00:16,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:04" (3/4) ... [2025-03-04 00:00:16,448 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:00:16,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:00:16,449 INFO L158 Benchmark]: Toolchain (without parser) took 13710.17ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.5MB in the beginning and 134.0MB in the end (delta: -29.6MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-04 00:00:16,452 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:16,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:00:16,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.49ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 84.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:16,452 INFO L158 Benchmark]: Boogie Preprocessor took 51.25ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:00:16,452 INFO L158 Benchmark]: IcfgBuilder took 896.57ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 48.3MB in the end (delta: 31.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:00:16,453 INFO L158 Benchmark]: TraceAbstraction took 12414.90ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.3MB in the beginning and 134.1MB in the end (delta: -85.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2025-03-04 00:00:16,453 INFO L158 Benchmark]: Witness Printer took 7.28ms. Allocated memory is still 285.2MB. Free memory was 134.1MB in the beginning and 134.0MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:16,456 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.29ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.49ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 84.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.25ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 896.57ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 48.3MB in the end (delta: 31.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12414.90ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.3MB in the beginning and 134.1MB in the end (delta: -85.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 7.28ms. Allocated memory is still 285.2MB. Free memory was 134.1MB in the beginning and 134.0MB in the end (delta: 87.7kB). 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 124, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someUnaryFLOAToperation at line 61, overapproximation of someBinaryArithmeticFLOAToperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND FALSE !((- last_1_var_1_27) < var_1_7) [L61] var_1_21 = ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=5, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L86] COND FALSE !(var_1_28 <= stepLocal_3) [L89] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L91] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L92] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L97] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L98] COND TRUE stepLocal_4 > var_1_37 [L99] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L113] COND TRUE (var_1_37 ^ (4u / var_1_33)) != var_1_17 [L114] var_1_32 = ((99.6f != var_1_7) || var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L118] COND TRUE ((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23 [L119] var_1_1 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L121] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L123] COND TRUE var_1_1 < var_1_21 [L124] var_1_27 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L127] COND TRUE ((var_1_16 * var_1_6) > var_1_15) && var_1_32 [L128] var_1_22 = var_1_6 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=2, var_1_22=5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=4, var_1_34=0, var_1_35=3, var_1_36=4, var_1_37=0, var_1_6=5, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2068 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2062 mSDsluCounter, 4468 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3122 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2173 IncrementalHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 1346 mSDtfsCounter, 2173 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 830 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=7, InterpolantAutomatonStates: 58, 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, 922 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2280 NumberOfCodeBlocks, 2280 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2262 ConstructedInterpolants, 0 QuantifiedInterpolants, 6190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1193 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 13782/14168 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-04 00:00:16,539 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_operatoramount_amount100_file-80.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 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:00:19,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:00:20,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:00:20,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:00:20,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:00:20,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:00:20,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:00:20,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:00:20,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:00:20,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:00:20,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:00:20,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:00:20,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:00:20,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:00:20,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:00:20,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:00:20,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:20,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:00:20,219 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:00:20,220 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:00:20,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:00:20,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:00:20,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:00:20,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:00:20,220 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 -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2025-03-04 00:00:20,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:00:20,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:00:20,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:00:20,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:00:20,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:00:20,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:22,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac417725/608f0dd07e24468b95553d2f39ba7b30/FLAG0c47c1230 [2025-03-04 00:00:22,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:00:22,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:22,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac417725/608f0dd07e24468b95553d2f39ba7b30/FLAG0c47c1230 [2025-03-04 00:00:22,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac417725/608f0dd07e24468b95553d2f39ba7b30 [2025-03-04 00:00:22,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:00:22,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:00:22,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:22,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:00:22,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:00:22,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:22" (1/1) ... [2025-03-04 00:00:22,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a06bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:22, skipping insertion in model container [2025-03-04 00:00:22,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:22" (1/1) ... [2025-03-04 00:00:22,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:00:23,165 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_operatoramount_amount100_file-80.i[916,929] [2025-03-04 00:00:23,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:23,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:00:23,358 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_operatoramount_amount100_file-80.i[916,929] [2025-03-04 00:00:23,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:23,470 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:00:23,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23 WrapperNode [2025-03-04 00:00:23,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:23,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:23,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:00:23,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:00:23,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,570 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-04 00:00:23,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:23,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:00:23,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:00:23,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:00:23,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,637 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-04 00:00:23,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:00:23,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:00:23,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:00:23,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:00:23,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (1/1) ... [2025-03-04 00:00:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:23,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:23,758 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-04 00:00:23,771 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-04 00:00:23,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:00:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:00:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:00:23,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:00:23,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:00:23,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:00:23,938 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:00:23,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:00:53,298 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 00:00:53,299 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:00:53,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:00:53,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:00:53,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:53 BoogieIcfgContainer [2025-03-04 00:00:53,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:00:53,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:00:53,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:00:53,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:00:53,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:00:22" (1/3) ... [2025-03-04 00:00:53,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3ca8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:53, skipping insertion in model container [2025-03-04 00:00:53,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:23" (2/3) ... [2025-03-04 00:00:53,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3ca8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:53, skipping insertion in model container [2025-03-04 00:00:53,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:53" (3/3) ... [2025-03-04 00:00:53,321 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2025-03-04 00:00:53,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:00:53,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-80.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:00:53,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:00:53,381 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;@475ad5e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:00:53,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:00:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 00:00:53,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:53,392 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:53,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:53,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1326822869, now seen corresponding path program 1 times [2025-03-04 00:00:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:00:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907323614] [2025-03-04 00:00:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:53,407 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-04 00:00:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:00:53,410 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-04 00:00:53,428 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-04 00:00:53,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 00:00:54,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 00:00:54,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:54,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:00:54,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:00:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-04 00:00:54,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:00:54,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:00:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907323614] [2025-03-04 00:00:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907323614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:00:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597691373] [2025-03-04 00:00:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:00:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:00:54,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:00:54,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:00:54,512 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:54,533 INFO L93 Difference]: Finished difference Result 154 states and 266 transitions. [2025-03-04 00:00:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:00:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-04 00:00:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:54,540 INFO L225 Difference]: With dead ends: 154 [2025-03-04 00:00:54,541 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 00:00:54,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-04 00:00:54,547 INFO L435 NwaCegarLoop]: 119 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, 119 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-04 00:00:54,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:00:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 00:00:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 00:00:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2025-03-04 00:00:54,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 156 [2025-03-04 00:00:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2025-03-04 00:00:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2025-03-04 00:00:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 00:00:54,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:54,592 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:00:54,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:00:54,793 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-04 00:00:54,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:54,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash -845203014, now seen corresponding path program 1 times [2025-03-04 00:00:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:00:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353389848] [2025-03-04 00:00:54,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:54,795 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-04 00:00:54,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:00:54,797 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-04 00:00:54,799 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-04 00:00:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 00:00:55,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 00:00:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:55,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:00:55,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:01:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-04 00:01:04,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:01:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:01:08,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:01:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353389848] [2025-03-04 00:01:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353389848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:01:08,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:01:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2025-03-04 00:01:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080939679] [2025-03-04 00:01:08,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:01:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:01:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:01:08,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:01:08,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:01:08,589 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-04 00:01:18,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:22,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:34,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:38,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:42,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []