./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.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 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:05:40,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:05:40,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:05:40,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:05:40,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:05:40,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:05:40,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:05:40,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:05:40,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:05:40,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:05:40,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:05:40,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:05:40,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:05:40,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:05:40,936 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:05:40,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:05:40,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:05:40,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:05:40,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:40,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:05:40,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:05:40,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:05:40,938 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 -> 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 [2025-03-08 14:05:41,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:05:41,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:05:41,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:05:41,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:05:41,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:05:41,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:05:42,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eab9a01/b1ba5737021f4440979a76091fe7ef37/FLAG8d65c2fcd [2025-03-08 14:05:42,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:05:42,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:05:42,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eab9a01/b1ba5737021f4440979a76091fe7ef37/FLAG8d65c2fcd [2025-03-08 14:05:42,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eab9a01/b1ba5737021f4440979a76091fe7ef37 [2025-03-08 14:05:42,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:05:42,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:05:42,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:42,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:05:42,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:05:42,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b17cd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42, skipping insertion in model container [2025-03-08 14:05:42,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:05:42,617 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2025-03-08 14:05:42,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:42,686 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:05:42,692 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2025-03-08 14:05:42,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:42,725 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:05:42,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42 WrapperNode [2025-03-08 14:05:42,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:42,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:42,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:05:42,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:05:42,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,786 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 288 [2025-03-08 14:05:42,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:42,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:05:42,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:05:42,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:05:42,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:05:42,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:05:42,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:05:42,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:05:42,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:05:42,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (1/1) ... [2025-03-08 14:05:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:42,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:05:42,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:05:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:05:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:05:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:05:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:05:42,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:05:42,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:05:42,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:05:42,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:05:43,295 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc property_#t~ite25#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1;havoc property_#t~ite30#1;havoc property_#t~bitwise27#1;havoc property_#t~ite29#1;havoc property_#t~bitwise28#1;havoc property_#t~short31#1; [2025-03-08 14:05:43,327 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-08 14:05:43,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:05:43,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:05:43,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:05:43,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:43 BoogieIcfgContainer [2025-03-08 14:05:43,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:05:43,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:05:43,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:05:43,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:05:43,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:42" (1/3) ... [2025-03-08 14:05:43,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12151201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:43, skipping insertion in model container [2025-03-08 14:05:43,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:42" (2/3) ... [2025-03-08 14:05:43,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12151201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:43, skipping insertion in model container [2025-03-08 14:05:43,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:43" (3/3) ... [2025-03-08 14:05:43,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:05:43,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:05:43,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-10.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:05:43,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:05:43,434 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;@1d30a8a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:05:43,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:05:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:05:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:05:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:43,450 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:43,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -305705014, now seen corresponding path program 1 times [2025-03-08 14:05:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246780634] [2025-03-08 14:05:43,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:05:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:05:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 14:05:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246780634] [2025-03-08 14:05:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246780634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352833392] [2025-03-08 14:05:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:43,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:05:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:05:43,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:05:43,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:05:43,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:43,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:43,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:05:43,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 14:05:43,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352833392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:43,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:05:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:05:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063492665] [2025-03-08 14:05:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:05:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:43,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:05:43,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:43,916 INFO L87 Difference]: Start difference. First operand has 123 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:05:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:43,954 INFO L93 Difference]: Finished difference Result 240 states and 403 transitions. [2025-03-08 14:05:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:05:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2025-03-08 14:05:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:43,962 INFO L225 Difference]: With dead ends: 240 [2025-03-08 14:05:43,962 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 14:05:43,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:43,966 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:43,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 14:05:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-08 14:05:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:05:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 185 transitions. [2025-03-08 14:05:44,004 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 185 transitions. Word has length 192 [2025-03-08 14:05:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 185 transitions. [2025-03-08 14:05:44,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:05:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 185 transitions. [2025-03-08 14:05:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:05:44,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:44,007 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:44,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:05:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:05:44,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:44,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1896207222, now seen corresponding path program 1 times [2025-03-08 14:05:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694089041] [2025-03-08 14:05:44,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:44,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:05:44,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:05:44,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:44,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:05:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694089041] [2025-03-08 14:05:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694089041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652011519] [2025-03-08 14:05:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:44,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:44,511 INFO L87 Difference]: Start difference. First operand 120 states and 185 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:44,543 INFO L93 Difference]: Finished difference Result 237 states and 367 transitions. [2025-03-08 14:05:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-08 14:05:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:44,546 INFO L225 Difference]: With dead ends: 237 [2025-03-08 14:05:44,546 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 14:05:44,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:44,547 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:44,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 14:05:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-08 14:05:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:05:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 184 transitions. [2025-03-08 14:05:44,560 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 184 transitions. Word has length 192 [2025-03-08 14:05:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:44,561 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 184 transitions. [2025-03-08 14:05:44,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 184 transitions. [2025-03-08 14:05:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:05:44,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:44,565 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:05:44,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -934593205, now seen corresponding path program 1 times [2025-03-08 14:05:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505333382] [2025-03-08 14:05:44,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:44,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:05:44,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:05:44,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:44,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:05:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505333382] [2025-03-08 14:05:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505333382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:05:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877115841] [2025-03-08 14:05:44,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:05:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:44,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:05:44,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:05:44,964 INFO L87 Difference]: Start difference. First operand 120 states and 184 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:45,187 INFO L93 Difference]: Finished difference Result 411 states and 634 transitions. [2025-03-08 14:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:05:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-08 14:05:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:45,190 INFO L225 Difference]: With dead ends: 411 [2025-03-08 14:05:45,190 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 14:05:45,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:45,194 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 258 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:45,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 532 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:05:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 14:05:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2025-03-08 14:05:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 14:05:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 416 transitions. [2025-03-08 14:05:45,234 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 416 transitions. Word has length 192 [2025-03-08 14:05:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 416 transitions. [2025-03-08 14:05:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 416 transitions. [2025-03-08 14:05:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 14:05:45,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:45,239 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:05:45,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1061277379, now seen corresponding path program 1 times [2025-03-08 14:05:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596850968] [2025-03-08 14:05:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:05:45,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:05:45,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:45,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:05:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596850968] [2025-03-08 14:05:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596850968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:05:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894240149] [2025-03-08 14:05:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:05:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:45,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:05:45,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:05:45,839 INFO L87 Difference]: Start difference. First operand 269 states and 416 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:46,160 INFO L93 Difference]: Finished difference Result 885 states and 1362 transitions. [2025-03-08 14:05:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:05:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-03-08 14:05:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:46,167 INFO L225 Difference]: With dead ends: 885 [2025-03-08 14:05:46,167 INFO L226 Difference]: Without dead ends: 619 [2025-03-08 14:05:46,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:46,169 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 246 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:46,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 503 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:05:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-08 14:05:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 449. [2025-03-08 14:05:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 340 states have (on average 1.4176470588235295) internal successors, (482), 342 states have internal predecessors, (482), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 14:05:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 690 transitions. [2025-03-08 14:05:46,232 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 690 transitions. Word has length 194 [2025-03-08 14:05:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:46,233 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 690 transitions. [2025-03-08 14:05:46,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:05:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 690 transitions. [2025-03-08 14:05:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 14:05:46,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:46,235 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:46,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:05:46,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash 262315747, now seen corresponding path program 1 times [2025-03-08 14:05:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042293871] [2025-03-08 14:05:46,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:46,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:05:46,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:05:46,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:05:46,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042293871] [2025-03-08 14:05:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042293871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825158525] [2025-03-08 14:05:46,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:46,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:05:46,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:05:46,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:05:46,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:05:46,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:46,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:46,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:05:46,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 14:05:46,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:05:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:05:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825158525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:05:47,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:05:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 14:05:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647984928] [2025-03-08 14:05:47,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:05:47,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:05:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:47,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:05:47,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:05:47,166 INFO L87 Difference]: Start difference. First operand 449 states and 690 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-08 14:05:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:47,375 INFO L93 Difference]: Finished difference Result 919 states and 1397 transitions. [2025-03-08 14:05:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:05:47,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 194 [2025-03-08 14:05:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:47,379 INFO L225 Difference]: With dead ends: 919 [2025-03-08 14:05:47,379 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 14:05:47,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:05:47,381 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 294 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:47,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 358 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:05:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 14:05:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 465. [2025-03-08 14:05:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 352 states have (on average 1.3778409090909092) internal successors, (485), 354 states have internal predecessors, (485), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 14:05:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 693 transitions. [2025-03-08 14:05:47,429 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 693 transitions. Word has length 194 [2025-03-08 14:05:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:47,431 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 693 transitions. [2025-03-08 14:05:47,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-08 14:05:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 693 transitions. [2025-03-08 14:05:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:05:47,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:47,433 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:47,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:05:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:47,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:47,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2050333312, now seen corresponding path program 1 times [2025-03-08 14:05:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256499973] [2025-03-08 14:05:47,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:47,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:05:47,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:05:47,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:47,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:05:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999392542] [2025-03-08 14:05:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:47,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:47,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:05:47,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:05:47,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:05:47,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:05:47,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:47,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 14:05:47,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 987 proven. 282 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-08 14:05:51,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:05:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256499973] [2025-03-08 14:05:54,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:05:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999392542] [2025-03-08 14:05:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999392542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:54,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:05:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2025-03-08 14:05:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631060023] [2025-03-08 14:05:54,592 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:05:54,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 14:05:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:54,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 14:05:54,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 14:05:54,594 INFO L87 Difference]: Start difference. First operand 465 states and 693 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-08 14:05:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:55,882 INFO L93 Difference]: Finished difference Result 1063 states and 1531 transitions. [2025-03-08 14:05:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 14:05:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 195 [2025-03-08 14:05:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:55,886 INFO L225 Difference]: With dead ends: 1063 [2025-03-08 14:05:55,886 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 14:05:55,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 14:05:55,888 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 450 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:55,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1799 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:05:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 14:05:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 533. [2025-03-08 14:05:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 406 states have (on average 1.3374384236453203) internal successors, (543), 408 states have internal predecessors, (543), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 14:05:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 751 transitions. [2025-03-08 14:05:55,935 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 751 transitions. Word has length 195 [2025-03-08 14:05:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:55,935 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 751 transitions. [2025-03-08 14:05:55,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-08 14:05:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 751 transitions. [2025-03-08 14:05:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:05:55,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:55,938 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:55,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:05:56,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:56,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash 537805951, now seen corresponding path program 1 times [2025-03-08 14:05:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:56,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235432726] [2025-03-08 14:05:56,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:56,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:05:56,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:05:56,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:56,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:05:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143590811] [2025-03-08 14:05:56,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:56,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:05:56,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:05:56,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:05:56,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:05:56,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:56,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 14:05:56,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1002 proven. 210 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 14:05:57,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:05:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235432726] [2025-03-08 14:05:59,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:05:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143590811] [2025-03-08 14:05:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143590811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:59,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:05:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2025-03-08 14:05:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380477215] [2025-03-08 14:05:59,617 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:05:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 14:05:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:59,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 14:05:59,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 14:05:59,619 INFO L87 Difference]: Start difference. First operand 533 states and 751 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-08 14:06:02,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:06:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:02,457 INFO L93 Difference]: Finished difference Result 1282 states and 1812 transitions. [2025-03-08 14:06:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 14:06:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) Word has length 195 [2025-03-08 14:06:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:02,462 INFO L225 Difference]: With dead ends: 1282 [2025-03-08 14:06:02,462 INFO L226 Difference]: Without dead ends: 1066 [2025-03-08 14:06:02,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 14:06:02,464 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 954 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1829 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1317 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 14:06:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-08 14:06:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 601. [2025-03-08 14:06:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 469 states have (on average 1.3624733475479744) internal successors, (639), 470 states have internal predecessors, (639), 108 states have call successors, (108), 23 states have call predecessors, (108), 23 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 14:06:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 855 transitions. [2025-03-08 14:06:02,523 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 855 transitions. Word has length 195 [2025-03-08 14:06:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 855 transitions. [2025-03-08 14:06:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-08 14:06:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 855 transitions. [2025-03-08 14:06:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:06:02,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:02,526 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:02,532 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-08 14:06:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:02,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2045357760, now seen corresponding path program 1 times [2025-03-08 14:06:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:06:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195930180] [2025-03-08 14:06:02,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:06:02,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:06:02,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:06:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:06:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:06:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195930180] [2025-03-08 14:06:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195930180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:06:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:06:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:06:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682467574] [2025-03-08 14:06:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:06:02,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:06:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:06:02,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:06:02,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:06:02,802 INFO L87 Difference]: Start difference. First operand 601 states and 855 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:06:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:02,879 INFO L93 Difference]: Finished difference Result 1733 states and 2464 transitions. [2025-03-08 14:06:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:06:02,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-03-08 14:06:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:02,885 INFO L225 Difference]: With dead ends: 1733 [2025-03-08 14:06:02,885 INFO L226 Difference]: Without dead ends: 1135 [2025-03-08 14:06:02,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:06:02,887 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 174 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:02,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 459 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:06:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-08 14:06:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 596. [2025-03-08 14:06:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.3577586206896552) internal successors, (630), 465 states have internal predecessors, (630), 108 states have call successors, (108), 23 states have call predecessors, (108), 23 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 14:06:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-03-08 14:06:02,925 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 195 [2025-03-08 14:06:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:02,926 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-03-08 14:06:02,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:06:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-03-08 14:06:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:06:02,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:02,930 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 14:06:02,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:02,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2111141650, now seen corresponding path program 1 times [2025-03-08 14:06:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:06:02,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279272285] [2025-03-08 14:06:02,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:06:02,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:03,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:03,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:03,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:06:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354846104] [2025-03-08 14:06:03,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:03,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:06:03,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 14:06:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:03,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:03,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:03,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 14:06:03,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1041 proven. 321 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 14:06:05,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:06:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279272285] [2025-03-08 14:06:12,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:06:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354846104] [2025-03-08 14:06:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354846104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:06:12,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:06:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2025-03-08 14:06:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68790779] [2025-03-08 14:06:12,077 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:06:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 14:06:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:06:12,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 14:06:12,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1550, Unknown=1, NotChecked=0, Total=1892 [2025-03-08 14:06:12,078 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 30 states have internal predecessors, (98), 9 states have call successors, (28), 9 states have call predecessors, (28), 14 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-08 14:06:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:14,028 INFO L93 Difference]: Finished difference Result 1293 states and 1825 transitions. [2025-03-08 14:06:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 14:06:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 30 states have internal predecessors, (98), 9 states have call successors, (28), 9 states have call predecessors, (28), 14 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) Word has length 196 [2025-03-08 14:06:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:14,033 INFO L225 Difference]: With dead ends: 1293 [2025-03-08 14:06:14,033 INFO L226 Difference]: Without dead ends: 1076 [2025-03-08 14:06:14,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=542, Invalid=2109, Unknown=1, NotChecked=0, Total=2652 [2025-03-08 14:06:14,036 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 435 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:14,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2337 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 14:06:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-08 14:06:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1014. [2025-03-08 14:06:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 809 states have (on average 1.3658838071693449) internal successors, (1105), 811 states have internal predecessors, (1105), 160 states have call successors, (160), 44 states have call predecessors, (160), 44 states have return successors, (160), 158 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-08 14:06:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1425 transitions. [2025-03-08 14:06:14,091 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1425 transitions. Word has length 196 [2025-03-08 14:06:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:14,091 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1425 transitions. [2025-03-08 14:06:14,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 30 states have internal predecessors, (98), 9 states have call successors, (28), 9 states have call predecessors, (28), 14 states have return successors, (28), 8 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-08 14:06:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1425 transitions. [2025-03-08 14:06:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:06:14,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:14,095 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:14,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 14:06:14,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:14,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 598614289, now seen corresponding path program 1 times [2025-03-08 14:06:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:06:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434292954] [2025-03-08 14:06:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:06:14,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:06:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059154272] [2025-03-08 14:06:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:14,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:06:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 14:06:14,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:14,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 14:06:14,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1138 proven. 228 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-08 14:06:15,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:06:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434292954] [2025-03-08 14:06:17,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:06:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059154272] [2025-03-08 14:06:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059154272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:06:17,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:06:17,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2025-03-08 14:06:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841399990] [2025-03-08 14:06:17,824 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:06:17,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 14:06:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:06:17,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 14:06:17,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2025-03-08 14:06:17,825 INFO L87 Difference]: Start difference. First operand 1014 states and 1425 transitions. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-08 14:06:23,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 14:06:24,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:06:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:25,519 INFO L93 Difference]: Finished difference Result 1771 states and 2466 transitions. [2025-03-08 14:06:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 14:06:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 196 [2025-03-08 14:06:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:25,525 INFO L225 Difference]: With dead ends: 1771 [2025-03-08 14:06:25,525 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 14:06:25,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 14:06:25,527 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 335 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:25,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1468 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1902 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2025-03-08 14:06:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 14:06:25,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 833. [2025-03-08 14:06:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 675 states have (on average 1.36) internal successors, (918), 675 states have internal predecessors, (918), 112 states have call successors, (112), 45 states have call predecessors, (112), 45 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 14:06:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1142 transitions. [2025-03-08 14:06:25,590 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1142 transitions. Word has length 196 [2025-03-08 14:06:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1142 transitions. [2025-03-08 14:06:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-08 14:06:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1142 transitions. [2025-03-08 14:06:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:06:25,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:25,591 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:25,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 14:06:25,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:25,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1217591870, now seen corresponding path program 1 times [2025-03-08 14:06:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:06:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876290200] [2025-03-08 14:06:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:06:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:25,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:25,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:25,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:06:26,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:06:26,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876290200] [2025-03-08 14:06:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876290200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:06:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128612467] [2025-03-08 14:06:26,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:26,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:26,054 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:06:26,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 14:06:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:26,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:26,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:26,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:26,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:06:26,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-03-08 14:06:26,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:06:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128612467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:06:26,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:06:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 14:06:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720034906] [2025-03-08 14:06:26,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:06:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:06:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:06:26,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:06:26,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:06:26,421 INFO L87 Difference]: Start difference. First operand 833 states and 1142 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 14:06:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:26,669 INFO L93 Difference]: Finished difference Result 1695 states and 2309 transitions. [2025-03-08 14:06:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 14:06:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2025-03-08 14:06:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:26,672 INFO L225 Difference]: With dead ends: 1695 [2025-03-08 14:06:26,672 INFO L226 Difference]: Without dead ends: 865 [2025-03-08 14:06:26,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:06:26,674 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 239 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:26,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 357 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:06:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-08 14:06:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 849. [2025-03-08 14:06:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 687 states have (on average 1.339155749636099) internal successors, (920), 687 states have internal predecessors, (920), 112 states have call successors, (112), 49 states have call predecessors, (112), 49 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 14:06:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1144 transitions. [2025-03-08 14:06:26,725 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1144 transitions. Word has length 196 [2025-03-08 14:06:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1144 transitions. [2025-03-08 14:06:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 14:06:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1144 transitions. [2025-03-08 14:06:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:06:26,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:26,727 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:26,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 14:06:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:26,928 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1269920963, now seen corresponding path program 1 times [2025-03-08 14:06:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:06:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228792104] [2025-03-08 14:06:26,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:06:26,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:06:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422299975] [2025-03-08 14:06:26,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:06:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:26,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:06:26,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 14:06:27,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:27,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:27,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:06:27,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:06:27,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:06:27,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:06:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:06:27,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:06:27,248 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:06:27,249 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:06:27,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 14:06:27,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 14:06:27,454 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:27,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:06:27,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:06:27 BoogieIcfgContainer [2025-03-08 14:06:27,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:06:27,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:06:27,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:06:27,559 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:06:27,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:43" (3/4) ... [2025-03-08 14:06:27,561 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:06:27,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:06:27,562 INFO L158 Benchmark]: Toolchain (without parser) took 45052.24ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 104.5MB in the beginning and 307.7MB in the end (delta: -203.2MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,562 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:06:27,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.29ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,563 INFO L158 Benchmark]: Boogie Preprocessor took 62.80ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 72.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,563 INFO L158 Benchmark]: IcfgBuilder took 495.64ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 34.0MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,563 INFO L158 Benchmark]: TraceAbstraction took 44195.09ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 101.9MB in the beginning and 307.8MB in the end (delta: -205.9MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,564 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 520.1MB. Free memory was 307.8MB in the beginning and 307.7MB in the end (delta: 108.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:06:27,565 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.29ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.80ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 72.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 495.64ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 34.0MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44195.09ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 101.9MB in the beginning and 307.8MB in the end (delta: -205.9MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 520.1MB. Free memory was 307.8MB in the beginning and 307.7MB in the end (delta: 108.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of bitwiseOr at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_7 = 10000; [L24] unsigned short int var_1_8 = 20453; [L25] signed short int var_1_10 = -5; [L26] unsigned char var_1_12 = 5; [L27] unsigned short int var_1_13 = 63501; [L28] unsigned char var_1_14 = 1; [L29] float var_1_15 = 16.25; [L30] float var_1_16 = 5.13; [L31] float var_1_17 = 99999999.25; [L32] signed char var_1_18 = 0; [L33] signed char var_1_19 = -4; [L34] signed char var_1_20 = 16; [L35] signed char var_1_21 = -100; [L36] float var_1_22 = 31.4; [L37] float var_1_23 = 16.432; [L38] float var_1_24 = 9999.5; [L39] unsigned long int var_1_26 = 100000000; [L40] unsigned short int var_1_27 = 50; [L41] float var_1_28 = 255.5; [L42] unsigned short int var_1_29 = 16; [L43] unsigned short int var_1_30 = 21823; [L44] float var_1_31 = 3.325; [L45] signed long int var_1_33 = 8; [L46] signed short int var_1_35 = -1; [L47] signed short int var_1_36 = 32549; [L48] unsigned char var_1_37 = 1; [L49] unsigned char var_1_38 = 0; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 128; [L52] unsigned char var_1_41 = 0; [L53] unsigned char last_1_var_1_12 = 5; [L54] unsigned long int last_1_var_1_26 = 100000000; [L55] signed short int last_1_var_1_35 = -1; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_26 = var_1_26 [L197] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L149] var_1_7 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L150] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L151] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L151] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=20453] [L152] var_1_8 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L153] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L154] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L154] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L155] var_1_13 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L156] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L157] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L157] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L160] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L160] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L162] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L163] var_1_17 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L165] var_1_19 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L166] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L167] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L167] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L169] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L170] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L170] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L171] var_1_21 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L172] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L173] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L173] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L174] var_1_23 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L175] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L176] var_1_24 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L177] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L178] var_1_28 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L179] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L180] CALL assume_abort_if_not(var_1_28 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L180] RET assume_abort_if_not(var_1_28 != 0.0F) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L181] var_1_30 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_30 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L182] RET assume_abort_if_not(var_1_30 >= 16384) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L183] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L183] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L184] var_1_36 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_36 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L185] RET assume_abort_if_not(var_1_36 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L186] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L186] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L187] var_1_38 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L188] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L189] CALL assume_abort_if_not(var_1_38 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L189] RET assume_abort_if_not(var_1_38 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L190] var_1_39 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L191] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L192] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L192] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L208] RET updateVariables() [L209] CALL step() [L59] EXPR last_1_var_1_12 | last_1_var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L59] signed long int stepLocal_5 = last_1_var_1_12 | last_1_var_1_35; [L60] COND TRUE var_1_16 >= (var_1_17 / var_1_28) [L61] var_1_27 = (last_1_var_1_26 + var_1_14) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L67] signed long int stepLocal_2 = 4 + var_1_13; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_2=32771, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L68] COND FALSE !((16 / -5) >= stepLocal_2) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L71] var_1_40 = var_1_14 [L72] var_1_10 = (var_1_40 - var_1_40) [L73] unsigned char stepLocal_1 = var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_1=1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L74] COND FALSE !(stepLocal_1 >= 4) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L81] COND FALSE !(var_1_8 <= var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L84] unsigned short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_4=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L85] COND TRUE stepLocal_4 >= var_1_40 [L86] var_1_26 = var_1_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L88] unsigned long int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_0=16383, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L89] COND FALSE !(stepLocal_0 <= 32) [L94] var_1_1 = ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L96] COND TRUE var_1_24 < var_1_16 [L97] var_1_33 = (var_1_30 + ((var_1_1 + var_1_27) - 10)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L99] unsigned short int stepLocal_10 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L100] COND FALSE !(var_1_15 > (var_1_23 / var_1_28)) [L107] var_1_41 = var_1_38 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L109] signed short int stepLocal_9 = var_1_36; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_9=16383, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L110] COND TRUE stepLocal_9 <= var_1_30 [L111] var_1_37 = ((! var_1_41) && var_1_38) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L115] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L118] COND FALSE !(\read(var_1_37)) [L121] var_1_29 = ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L123] unsigned char stepLocal_8 = var_1_37; [L124] unsigned short int stepLocal_7 = var_1_13; [L125] signed long int stepLocal_6 = - var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_6=-1, stepLocal_7=32767, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L126] COND TRUE (var_1_40 / var_1_8) <= stepLocal_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_6=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L127] COND FALSE !(var_1_14 == stepLocal_6) [L132] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L137] signed long int stepLocal_3 = (var_1_7 * var_1_12) * (var_1_29 * var_1_12); VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_3=13420134450, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L138] COND FALSE !(stepLocal_3 == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L141] COND FALSE !(\read(var_1_41)) [L144] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-180225, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR ((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L200] EXPR (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L200-L201] return (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=16383, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=81919, var_1_8=-180225] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 218 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.0s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3414 SdHoareTripleChecker+Valid, 12.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3385 mSDsluCounter, 10172 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8061 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7604 IncrementalHoareTripleChecker+Invalid, 7872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 2111 mSDtfsCounter, 7604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2012 GetRequests, 1809 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1014occurred in iteration=9, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 2074 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 3893 NumberOfCodeBlocks, 3893 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3093 ConstructedInterpolants, 14 QuantifiedInterpolants, 23142 SizeOfPredicates, 43 NumberOfNonLiveVariables, 3206 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 22854/24192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:06:27,663 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_loopvsstraightlinecode_100-while_file-10.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 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:06:29,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:06:29,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:06:29,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:06:29,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:06:29,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:06:29,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:06:29,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:06:29,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:06:29,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:06:29,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:06:29,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:06:29,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:06:29,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:06:29,394 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:06:29,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:06:29,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:06:29,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:06:29,395 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:06:29,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:06:29,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:06:29,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:06:29,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:06:29,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:06:29,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:06:29,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:06:29,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:06:29,398 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 -> 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 [2025-03-08 14:06:29,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:06:29,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:06:29,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:06:29,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:06:29,636 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:06:29,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:06:30,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605ca7dc/d27406a81db74e989817ef4f3ae26bd5/FLAGc748817d0 [2025-03-08 14:06:31,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:06:31,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:06:31,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605ca7dc/d27406a81db74e989817ef4f3ae26bd5/FLAGc748817d0 [2025-03-08 14:06:31,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605ca7dc/d27406a81db74e989817ef4f3ae26bd5 [2025-03-08 14:06:31,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:06:31,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:06:31,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:06:31,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:06:31,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:06:31,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31, skipping insertion in model container [2025-03-08 14:06:31,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:06:31,514 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2025-03-08 14:06:31,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:06:31,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:06:31,619 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2025-03-08 14:06:31,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:06:31,658 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:06:31,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31 WrapperNode [2025-03-08 14:06:31,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:06:31,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:06:31,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:06:31,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:06:31,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,693 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-08 14:06:31,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:06:31,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:06:31,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:06:31,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:06:31,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:06:31,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:06:31,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:06:31,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:06:31,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:06:31,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (1/1) ... [2025-03-08 14:06:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:06:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:31,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:06:31,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:06:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:06:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:06:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:06:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:06:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:06:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:06:31,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:06:31,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:06:38,105 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 14:06:38,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:06:38,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:06:38,119 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:06:38,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:38 BoogieIcfgContainer [2025-03-08 14:06:38,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:06:38,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:06:38,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:06:38,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:06:38,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:06:31" (1/3) ... [2025-03-08 14:06:38,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce171a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:38, skipping insertion in model container [2025-03-08 14:06:38,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:31" (2/3) ... [2025-03-08 14:06:38,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce171a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:38, skipping insertion in model container [2025-03-08 14:06:38,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:38" (3/3) ... [2025-03-08 14:06:38,130 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-10.i [2025-03-08 14:06:38,141 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:06:38,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-10.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:06:38,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:06:38,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;@1c8d1189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:06:38,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:06:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:06:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 14:06:38,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:38,221 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:38,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:38,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1700055309, now seen corresponding path program 1 times [2025-03-08 14:06:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817383901] [2025-03-08 14:06:38,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:38,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:06:38,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:06:38,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 14:06:38,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 14:06:38,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:38,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:38,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:06:38,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-08 14:06:38,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:06:38,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817383901] [2025-03-08 14:06:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817383901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:06:38,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:06:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:06:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065379311] [2025-03-08 14:06:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:06:38,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:06:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:38,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:06:38,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:06:38,821 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:06:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:38,839 INFO L93 Difference]: Finished difference Result 174 states and 301 transitions. [2025-03-08 14:06:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:06:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2025-03-08 14:06:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:38,845 INFO L225 Difference]: With dead ends: 174 [2025-03-08 14:06:38,845 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 14:06:38,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:06:38,848 INFO L435 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:38,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:06:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 14:06:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 14:06:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:06:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-03-08 14:06:38,877 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 186 [2025-03-08 14:06:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:38,877 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-03-08 14:06:38,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:06:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-03-08 14:06:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 14:06:38,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:38,882 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:38,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:06:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:39,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:39,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1601348531, now seen corresponding path program 1 times [2025-03-08 14:06:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:39,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183647905] [2025-03-08 14:06:39,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:39,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:39,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:39,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:06:39,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:06:39,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 14:06:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 14:06:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:39,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:06:39,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:06:39,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:06:39,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183647905] [2025-03-08 14:06:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183647905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:06:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:06:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:06:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237539664] [2025-03-08 14:06:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:06:39,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:06:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:06:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:06:39,699 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:06:42,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 14:06:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:42,708 INFO L93 Difference]: Finished difference Result 171 states and 263 transitions. [2025-03-08 14:06:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:06:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-08 14:06:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:42,747 INFO L225 Difference]: With dead ends: 171 [2025-03-08 14:06:42,747 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 14:06:42,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:06:42,749 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:42,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 14:06:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 14:06:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 14:06:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:06:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2025-03-08 14:06:42,758 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 186 [2025-03-08 14:06:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2025-03-08 14:06:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:06:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2025-03-08 14:06:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 14:06:42,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:42,762 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:42,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:06:42,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:42,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:42,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1448854284, now seen corresponding path program 1 times [2025-03-08 14:06:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:42,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710679980] [2025-03-08 14:06:42,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:42,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:42,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:42,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:06:42,966 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 (4)] Waiting until timeout for monitored process [2025-03-08 14:06:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 14:06:43,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 14:06:43,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:43,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:43,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:06:43,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2025-03-08 14:06:46,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:46,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710679980] [2025-03-08 14:06:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710679980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:06:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671934012] [2025-03-08 14:06:46,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:06:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:06:46,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:06:46,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 14:06:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 14:06:47,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 14:06:47,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:47,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:47,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:06:47,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 14:06:49,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [671934012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:06:49,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:06:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2025-03-08 14:06:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202192195] [2025-03-08 14:06:49,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:06:49,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:06:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:49,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:06:49,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:06:49,448 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-08 14:06:55,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:06:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:55,526 INFO L93 Difference]: Finished difference Result 181 states and 269 transitions. [2025-03-08 14:06:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 14:06:55,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 186 [2025-03-08 14:06:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:55,569 INFO L225 Difference]: With dead ends: 181 [2025-03-08 14:06:55,569 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 14:06:55,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:06:55,570 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:06:55,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 355 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-03-08 14:06:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 14:06:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-08 14:06:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:06:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2025-03-08 14:06:55,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 186 [2025-03-08 14:06:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:55,582 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2025-03-08 14:06:55,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-08 14:06:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2025-03-08 14:06:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 14:06:55,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:55,585 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:55,602 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 (4)] Ended with exit code 0 [2025-03-08 14:06:55,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 14:06:55,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 14:06:55,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:55,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1527603183, now seen corresponding path program 1 times [2025-03-08 14:06:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321642992] [2025-03-08 14:06:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:06:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:55,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:06:55,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 14:06:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 14:06:56,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 14:06:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:06:56,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-03-08 14:06:56,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:06:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:06:57,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321642992] [2025-03-08 14:06:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321642992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:06:57,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:06:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 14:06:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110798732] [2025-03-08 14:06:57,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:06:57,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:06:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:57,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:06:57,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:06:57,887 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 14:07:03,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:05,429 INFO L93 Difference]: Finished difference Result 295 states and 416 transitions. [2025-03-08 14:07:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 14:07:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 187 [2025-03-08 14:07:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:05,432 INFO L225 Difference]: With dead ends: 295 [2025-03-08 14:07:05,432 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 14:07:05,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:07:05,433 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 316 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 473 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-03-08 14:07:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 14:07:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 101. [2025-03-08 14:07:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:07:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-08 14:07:05,451 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 187 [2025-03-08 14:07:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:05,451 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-08 14:07:05,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 14:07:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-08 14:07:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 14:07:05,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:05,453 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:05,470 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 (6)] Ended with exit code 0 [2025-03-08 14:07:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:07:05,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 773899249, now seen corresponding path program 1 times [2025-03-08 14:07:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:07:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906155976] [2025-03-08 14:07:05,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:07:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:07:05,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:07:05,658 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 (7)] Waiting until timeout for monitored process [2025-03-08 14:07:05,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.