./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.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 642b2fed84dd057e86e425ac6d1d3d4f3df46a198721c926ed6693b39af42380 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:06:30,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:06:30,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:06:30,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:06:30,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:06:30,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:06:30,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:06:30,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:06:30,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:06:30,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:06:30,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:06:30,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:06:30,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:06:30,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:06:30,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:06:30,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:06:30,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:06:30,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:30,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:06:30,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:06:30,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:06:30,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:06:30,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:06:30,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:06:30,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:06:30,819 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 -> 642b2fed84dd057e86e425ac6d1d3d4f3df46a198721c926ed6693b39af42380 [2025-03-03 21:06:31,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:06:31,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:06:31,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:06:31,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:06:31,036 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:06:31,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:32,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7102379/b32f9bb6aa784e20a6372e643125807e/FLAG89cd692f3 [2025-03-03 21:06:32,425 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:06:32,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:32,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7102379/b32f9bb6aa784e20a6372e643125807e/FLAG89cd692f3 [2025-03-03 21:06:32,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7102379/b32f9bb6aa784e20a6372e643125807e [2025-03-03 21:06:32,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:06:32,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:06:32,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:32,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:06:32,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:06:32,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32, skipping insertion in model container [2025-03-03 21:06:32,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:06:32,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i[919,932] [2025-03-03 21:06:32,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:32,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:06:32,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i[919,932] [2025-03-03 21:06:32,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:32,708 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:06:32,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32 WrapperNode [2025-03-03 21:06:32,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:32,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:32,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:06:32,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:06:32,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,761 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-03 21:06:32,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:32,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:06:32,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:06:32,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:06:32,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:06:32,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:06:32,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:06:32,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:06:32,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:06:32,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (1/1) ... [2025-03-03 21:06:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:32,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:06:32,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:06:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:06:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:06:32,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:06:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:06:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:06:32,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:06:32,926 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:06:32,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:06:33,199 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 21:06:33,225 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:06:33,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:06:33,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:06:33,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:06:33,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:33 BoogieIcfgContainer [2025-03-03 21:06:33,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:06:33,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:06:33,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:06:33,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:06:33,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:06:32" (1/3) ... [2025-03-03 21:06:33,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5190c3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:33, skipping insertion in model container [2025-03-03 21:06:33,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:32" (2/3) ... [2025-03-03 21:06:33,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5190c3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:33, skipping insertion in model container [2025-03-03 21:06:33,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:33" (3/3) ... [2025-03-03 21:06:33,253 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:33,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:06:33,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:06:33,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:06:33,311 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;@55162d85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:06:33,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:06:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 78 states have internal predecessors, (117), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:06:33,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:33,327 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:33,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -787306574, now seen corresponding path program 1 times [2025-03-03 21:06:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940659929] [2025-03-03 21:06:33,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:33,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:06:33,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:06:33,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:33,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:06:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940659929] [2025-03-03 21:06:33,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940659929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:06:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915358302] [2025-03-03 21:06:33,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:33,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:06:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:33,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:06:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:06:33,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:06:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:06:33,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:33,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:33,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:06:33,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:06:33,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:06:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915358302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:06:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:06:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877548841] [2025-03-03 21:06:33,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:33,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:06:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:33,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:06:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:06:33,786 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 78 states have internal predecessors, (117), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:33,818 INFO L93 Difference]: Finished difference Result 196 states and 337 transitions. [2025-03-03 21:06:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:06:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-03-03 21:06:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:33,825 INFO L225 Difference]: With dead ends: 196 [2025-03-03 21:06:33,825 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 21:06:33,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:06:33,831 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:33,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:06:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 21:06:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 21:06:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 73 states have internal predecessors, (107), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 151 transitions. [2025-03-03 21:06:33,865 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 151 transitions. Word has length 152 [2025-03-03 21:06:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:33,865 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 151 transitions. [2025-03-03 21:06:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 151 transitions. [2025-03-03 21:06:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:06:33,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:33,867 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:33,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:06:34,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:06:34,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash 551198000, now seen corresponding path program 1 times [2025-03-03 21:06:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831290731] [2025-03-03 21:06:34,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:06:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:06:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831290731] [2025-03-03 21:06:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831290731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:34,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:06:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579740314] [2025-03-03 21:06:34,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:06:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:34,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:06:34,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,296 INFO L87 Difference]: Start difference. First operand 97 states and 151 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:34,380 INFO L93 Difference]: Finished difference Result 285 states and 447 transitions. [2025-03-03 21:06:34,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:06:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:06:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:34,383 INFO L225 Difference]: With dead ends: 285 [2025-03-03 21:06:34,383 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 21:06:34,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,384 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:34,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 367 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:06:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 21:06:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2025-03-03 21:06:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.518181818181818) internal successors, (167), 110 states have internal predecessors, (167), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 211 transitions. [2025-03-03 21:06:34,425 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 211 transitions. Word has length 152 [2025-03-03 21:06:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:34,426 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 211 transitions. [2025-03-03 21:06:34,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 211 transitions. [2025-03-03 21:06:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 21:06:34,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:34,430 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:34,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:06:34,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:34,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash -419123852, now seen corresponding path program 1 times [2025-03-03 21:06:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:34,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502157313] [2025-03-03 21:06:34,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:34,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 21:06:34,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 21:06:34,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:34,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502157313] [2025-03-03 21:06:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502157313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:06:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925888721] [2025-03-03 21:06:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:06:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:34,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:06:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,552 INFO L87 Difference]: Start difference. First operand 134 states and 211 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:34,580 INFO L93 Difference]: Finished difference Result 226 states and 351 transitions. [2025-03-03 21:06:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:06:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 21:06:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:34,582 INFO L225 Difference]: With dead ends: 226 [2025-03-03 21:06:34,582 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 21:06:34,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,583 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:34,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:06:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 21:06:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-03 21:06:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2025-03-03 21:06:34,589 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 153 [2025-03-03 21:06:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:34,590 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2025-03-03 21:06:34,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2025-03-03 21:06:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 21:06:34,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:34,591 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:34,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:06:34,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:34,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 379854253, now seen corresponding path program 1 times [2025-03-03 21:06:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326317507] [2025-03-03 21:06:34,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:34,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 21:06:34,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 21:06:34,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:34,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:34,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326317507] [2025-03-03 21:06:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326317507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:06:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669182833] [2025-03-03 21:06:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:06:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:34,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:06:34,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,685 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:34,734 INFO L93 Difference]: Finished difference Result 277 states and 416 transitions. [2025-03-03 21:06:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:06:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 21:06:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:34,737 INFO L225 Difference]: With dead ends: 277 [2025-03-03 21:06:34,737 INFO L226 Difference]: Without dead ends: 185 [2025-03-03 21:06:34,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:06:34,738 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 127 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:34,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 359 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:06:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-03 21:06:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2025-03-03 21:06:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 136 states have internal predecessors, (185), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:06:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 273 transitions. [2025-03-03 21:06:34,759 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 273 transitions. Word has length 154 [2025-03-03 21:06:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:34,760 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 273 transitions. [2025-03-03 21:06:34,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 273 transitions. [2025-03-03 21:06:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 21:06:34,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:34,762 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:34,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:06:34,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:34,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1427600210, now seen corresponding path program 1 times [2025-03-03 21:06:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342425926] [2025-03-03 21:06:34,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:34,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 21:06:34,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 21:06:34,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342425926] [2025-03-03 21:06:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342425926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:06:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315808672] [2025-03-03 21:06:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:35,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:06:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:35,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:06:35,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:06:35,035 INFO L87 Difference]: Start difference. First operand 183 states and 273 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:35,511 INFO L93 Difference]: Finished difference Result 594 states and 888 transitions. [2025-03-03 21:06:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:06:35,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 21:06:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:35,514 INFO L225 Difference]: With dead ends: 594 [2025-03-03 21:06:35,514 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 21:06:35,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:06:35,515 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 287 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:35,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 808 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:06:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 21:06:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 251. [2025-03-03 21:06:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 181 states have (on average 1.3425414364640884) internal successors, (243), 181 states have internal predecessors, (243), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:06:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2025-03-03 21:06:35,551 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 154 [2025-03-03 21:06:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:35,551 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2025-03-03 21:06:35,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2025-03-03 21:06:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 21:06:35,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:35,553 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:35,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:06:35,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1134197203, now seen corresponding path program 1 times [2025-03-03 21:06:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769215579] [2025-03-03 21:06:35,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:35,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 21:06:35,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 21:06:35,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:35,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769215579] [2025-03-03 21:06:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769215579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:06:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539257835] [2025-03-03 21:06:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:06:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:35,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:06:35,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:06:35,810 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:35,943 INFO L93 Difference]: Finished difference Result 542 states and 792 transitions. [2025-03-03 21:06:35,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:06:35,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 21:06:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:35,946 INFO L225 Difference]: With dead ends: 542 [2025-03-03 21:06:35,946 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 21:06:35,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:06:35,947 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 97 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:35,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 387 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:06:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 21:06:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 324. [2025-03-03 21:06:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 239 states have (on average 1.3305439330543933) internal successors, (318), 241 states have internal predecessors, (318), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:06:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 474 transitions. [2025-03-03 21:06:35,971 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 474 transitions. Word has length 154 [2025-03-03 21:06:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:35,972 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 474 transitions. [2025-03-03 21:06:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 474 transitions. [2025-03-03 21:06:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 21:06:35,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:35,973 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:06:35,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 970791724, now seen corresponding path program 1 times [2025-03-03 21:06:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-03-03 21:06:35,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 21:06:36,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 21:06:36,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-03-03 21:06:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791962506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:06:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807915157] [2025-03-03 21:06:36,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:36,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:06:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:36,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:06:36,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:06:36,559 INFO L87 Difference]: Start difference. First operand 324 states and 474 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:36,833 INFO L93 Difference]: Finished difference Result 575 states and 841 transitions. [2025-03-03 21:06:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:06:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 21:06:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:36,836 INFO L225 Difference]: With dead ends: 575 [2025-03-03 21:06:36,836 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 21:06:36,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:36,837 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 185 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:36,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 801 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:06:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 21:06:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-03-03 21:06:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 239 states have (on average 1.3221757322175731) internal successors, (316), 241 states have internal predecessors, (316), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:06:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 472 transitions. [2025-03-03 21:06:36,873 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 472 transitions. Word has length 154 [2025-03-03 21:06:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 472 transitions. [2025-03-03 21:06:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 472 transitions. [2025-03-03 21:06:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:06:36,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:36,874 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:36,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:06:36,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2101803114, now seen corresponding path program 1 times [2025-03-03 21:06:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839920056] [2025-03-03 21:06:36,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:36,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:06:36,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:06:36,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839920056] [2025-03-03 21:06:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839920056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:06:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163570142] [2025-03-03 21:06:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:06:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:37,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:06:37,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:37,542 INFO L87 Difference]: Start difference. First operand 324 states and 472 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:06:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:37,918 INFO L93 Difference]: Finished difference Result 593 states and 851 transitions. [2025-03-03 21:06:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:06:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 155 [2025-03-03 21:06:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:37,921 INFO L225 Difference]: With dead ends: 593 [2025-03-03 21:06:37,921 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 21:06:37,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:06:37,922 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 286 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 246 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:06:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 21:06:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-03 21:06:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 254 states have (on average 1.295275590551181) internal successors, (329), 256 states have internal predecessors, (329), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:06:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2025-03-03 21:06:37,981 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 155 [2025-03-03 21:06:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2025-03-03 21:06:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:06:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2025-03-03 21:06:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:06:37,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:37,984 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:37,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:06:37,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2064081463, now seen corresponding path program 1 times [2025-03-03 21:06:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600762399] [2025-03-03 21:06:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:37,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:06:38,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:06:38,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:38,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600762399] [2025-03-03 21:06:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600762399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:06:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185453427] [2025-03-03 21:06:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:38,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:06:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:38,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:06:38,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:38,594 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:38,959 INFO L93 Difference]: Finished difference Result 611 states and 860 transitions. [2025-03-03 21:06:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:06:38,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-03 21:06:38,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:38,962 INFO L225 Difference]: With dead ends: 611 [2025-03-03 21:06:38,962 INFO L226 Difference]: Without dead ends: 346 [2025-03-03 21:06:38,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:06:38,963 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 233 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:38,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 756 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:06:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-03 21:06:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2025-03-03 21:06:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 254 states have (on average 1.2874015748031495) internal successors, (327), 256 states have internal predecessors, (327), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:06:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 483 transitions. [2025-03-03 21:06:39,002 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 483 transitions. Word has length 155 [2025-03-03 21:06:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:39,003 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 483 transitions. [2025-03-03 21:06:39,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 483 transitions. [2025-03-03 21:06:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:06:39,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:39,004 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:39,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:06:39,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:39,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1739927111, now seen corresponding path program 1 times [2025-03-03 21:06:39,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819914391] [2025-03-03 21:06:39,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:39,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:39,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:06:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:06:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:39,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819914391] [2025-03-03 21:06:39,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819914391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:06:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125184086] [2025-03-03 21:06:39,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:06:39,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:39,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:06:39,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:06:39,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:06:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:06:39,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:39,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:39,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:06:39,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 21:06:39,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:06:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125184086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:06:39,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:06:39,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 21:06:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432161981] [2025-03-03 21:06:39,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:06:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:06:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:06:39,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:39,582 INFO L87 Difference]: Start difference. First operand 344 states and 483 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:06:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:39,749 INFO L93 Difference]: Finished difference Result 600 states and 830 transitions. [2025-03-03 21:06:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:06:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 158 [2025-03-03 21:06:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:39,752 INFO L225 Difference]: With dead ends: 600 [2025-03-03 21:06:39,752 INFO L226 Difference]: Without dead ends: 334 [2025-03-03 21:06:39,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:06:39,753 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:39,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 298 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:06:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-03 21:06:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 320. [2025-03-03 21:06:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 234 states have (on average 1.2606837606837606) internal successors, (295), 235 states have internal predecessors, (295), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:06:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 439 transitions. [2025-03-03 21:06:39,789 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 439 transitions. Word has length 158 [2025-03-03 21:06:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:39,790 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 439 transitions. [2025-03-03 21:06:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:06:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 439 transitions. [2025-03-03 21:06:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:06:39,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:39,793 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:39,799 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-03 21:06:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:06:39,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1952901592, now seen corresponding path program 1 times [2025-03-03 21:06:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989370957] [2025-03-03 21:06:39,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:06:40,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:06:40,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:40,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:06:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989370957] [2025-03-03 21:06:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989370957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:06:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423181198] [2025-03-03 21:06:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:06:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:40,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:06:40,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:06:40,102 INFO L87 Difference]: Start difference. First operand 320 states and 439 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:40,293 INFO L93 Difference]: Finished difference Result 650 states and 883 transitions. [2025-03-03 21:06:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:06:40,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-03-03 21:06:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:40,296 INFO L225 Difference]: With dead ends: 650 [2025-03-03 21:06:40,296 INFO L226 Difference]: Without dead ends: 409 [2025-03-03 21:06:40,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:40,297 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 90 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:40,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 408 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:06:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-03 21:06:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 318. [2025-03-03 21:06:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 232 states have (on average 1.2543103448275863) internal successors, (291), 233 states have internal predecessors, (291), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:06:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 435 transitions. [2025-03-03 21:06:40,326 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 435 transitions. Word has length 158 [2025-03-03 21:06:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 435 transitions. [2025-03-03 21:06:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:06:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 435 transitions. [2025-03-03 21:06:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:06:40,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:40,328 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:40,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:06:40,328 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:40,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash -572253596, now seen corresponding path program 1 times [2025-03-03 21:06:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822196609] [2025-03-03 21:06:40,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:40,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:06:40,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:06:40,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:40,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:06:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822196609] [2025-03-03 21:06:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822196609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:06:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301344134] [2025-03-03 21:06:40,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:06:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:40,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:06:40,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:06:40,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:06:40,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:06:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:40,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:06:40,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-03-03 21:06:40,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:06:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301344134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:06:40,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:06:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 21:06:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882974522] [2025-03-03 21:06:40,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:06:40,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:06:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:06:40,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:06:40,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:06:40,775 INFO L87 Difference]: Start difference. First operand 318 states and 435 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:06:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:40,954 INFO L93 Difference]: Finished difference Result 581 states and 783 transitions. [2025-03-03 21:06:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:06:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 159 [2025-03-03 21:06:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:40,956 INFO L225 Difference]: With dead ends: 581 [2025-03-03 21:06:40,956 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 21:06:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:06:40,957 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 213 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:40,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 272 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:06:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 21:06:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 330. [2025-03-03 21:06:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 241 states have (on average 1.2365145228215768) internal successors, (298), 242 states have internal predecessors, (298), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:06:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 442 transitions. [2025-03-03 21:06:40,998 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 442 transitions. Word has length 159 [2025-03-03 21:06:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 442 transitions. [2025-03-03 21:06:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:06:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 442 transitions. [2025-03-03 21:06:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:06:41,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:41,000 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:41,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:06:41,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:06:41,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash -865656603, now seen corresponding path program 1 times [2025-03-03 21:06:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:06:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765918302] [2025-03-03 21:06:41,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:06:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:06:41,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:06:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:06:41,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:06:41,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:06:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:06:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:06:41,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:06:41,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:06:41,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:06:41,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:06:41,350 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:41,468 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:06:41,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:06:41 BoogieIcfgContainer [2025-03-03 21:06:41,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:06:41,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:06:41,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:06:41,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:06:41,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:33" (3/4) ... [2025-03-03 21:06:41,473 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:06:41,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:06:41,474 INFO L158 Benchmark]: Toolchain (without parser) took 9023.94ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 105.0MB in the beginning and 347.7MB in the end (delta: -242.6MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2025-03-03 21:06:41,474 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:06:41,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.96ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:06:41,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.54ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:06:41,475 INFO L158 Benchmark]: Boogie Preprocessor took 49.70ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 82.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:06:41,476 INFO L158 Benchmark]: IcfgBuilder took 429.54ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 52.8MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:06:41,476 INFO L158 Benchmark]: TraceAbstraction took 8222.36ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 52.8MB in the beginning and 347.8MB in the end (delta: -294.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-03-03 21:06:41,476 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 469.8MB. Free memory was 347.8MB in the beginning and 347.7MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:06:41,477 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.87ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.96ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.54ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.70ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 82.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 429.54ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 52.8MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8222.36ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 52.8MB in the beginning and 347.8MB in the end (delta: -294.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 469.8MB. Free memory was 347.8MB in the beginning and 347.7MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] unsigned short int var_1_33 = 16; [L43] unsigned char var_1_39 = 4; [L44] signed long int var_1_41 = -5; [L45] double var_1_42 = 49.6; [L46] signed long int var_1_45 = -2; [L47] unsigned long int var_1_47 = 16; [L48] unsigned long int var_1_50 = 1275815169; [L49] unsigned long int var_1_51 = 1483937619; [L50] signed short int last_1_var_1_1 = 4; [L51] unsigned char last_1_var_1_14 = 1; [L52] signed char last_1_var_1_16 = 50; [L53] signed long int last_1_var_1_23 = -16; [L54] unsigned char last_1_var_1_24 = 1; [L55] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L180] last_1_var_1_23 = var_1_23 [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L141] var_1_11 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] var_1_13 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] var_1_21 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_22 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] var_1_25 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_26 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] var_1_50 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L172] var_1_51 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L173] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L174] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L174] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L193] RET updateVariables() [L194] CALL step() [L59] signed long int stepLocal_3 = last_1_var_1_23; [L60] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L61] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L72] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L74] COND FALSE !(1000000.4f != var_1_22) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L79] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L79] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L80] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L84] var_1_39 = var_1_26 [L85] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L86] var_1_29 = var_1_12 [L87] var_1_31 = var_1_19 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L88] COND FALSE !(var_1_12 != var_1_1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L93] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L94] COND FALSE !(var_1_21 < var_1_21) [L107] var_1_47 = var_1_23 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L109] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L110] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L111] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L115] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L116] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L117] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L117] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L118] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L120] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L121] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L125] COND TRUE \read(var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L126] COND TRUE var_1_11 < var_1_19 [L127] var_1_33 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L134] COND FALSE !(var_1_14 && var_1_27) [L137] var_1_45 = ((var_1_19 + var_1_23) + var_1_26) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185-L186] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=125, var_1_12=4, var_1_13=128, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=125, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1738 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1716 mSDsluCounter, 5116 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3040 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1723 IncrementalHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 2076 mSDtfsCounter, 1723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 808 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 383 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2486 NumberOfCodeBlocks, 2486 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2627 ConstructedInterpolants, 0 QuantifiedInterpolants, 6357 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1173 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 15495/15708 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:06:41,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.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 642b2fed84dd057e86e425ac6d1d3d4f3df46a198721c926ed6693b39af42380 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:06:43,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:06:43,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:06:43,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:06:43,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:06:43,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:06:43,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:06:43,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:06:43,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:06:43,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:06:43,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:06:43,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:06:43,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:06:43,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:06:43,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:06:43,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:06:43,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:06:43,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:06:43,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:06:43,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:06:43,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:06:43,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:06:43,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:06:43,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:43,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:06:43,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:06:43,364 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 -> 642b2fed84dd057e86e425ac6d1d3d4f3df46a198721c926ed6693b39af42380 [2025-03-03 21:06:43,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:06:43,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:06:43,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:06:43,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:06:43,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:06:43,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:44,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d051793/7eb0d8aa1eca45c9be9fbbdf49d1a145/FLAGf9879d6a7 [2025-03-03 21:06:44,921 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:06:44,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:44,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d051793/7eb0d8aa1eca45c9be9fbbdf49d1a145/FLAGf9879d6a7 [2025-03-03 21:06:45,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d051793/7eb0d8aa1eca45c9be9fbbdf49d1a145 [2025-03-03 21:06:45,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:06:45,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:06:45,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:45,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:06:45,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:06:45,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502ef9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45, skipping insertion in model container [2025-03-03 21:06:45,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:06:45,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i[919,932] [2025-03-03 21:06:45,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:45,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:06:45,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i[919,932] [2025-03-03 21:06:45,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:06:45,525 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:06:45,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45 WrapperNode [2025-03-03 21:06:45,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:06:45,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:45,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:06:45,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:06:45,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,560 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-03 21:06:45,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:06:45,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:06:45,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:06:45,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:06:45,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,585 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:06:45,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:06:45,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:06:45,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:06:45,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:06:45,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (1/1) ... [2025-03-03 21:06:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:06:45,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:06:45,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:06:45,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:06:45,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:06:45,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:06:45,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:06:45,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:06:45,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:06:45,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:06:45,721 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:06:45,723 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:06:47,400 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 21:06:47,400 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:06:47,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:06:47,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:06:47,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:47 BoogieIcfgContainer [2025-03-03 21:06:47,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:06:47,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:06:47,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:06:47,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:06:47,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:06:45" (1/3) ... [2025-03-03 21:06:47,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7a43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:47, skipping insertion in model container [2025-03-03 21:06:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:06:45" (2/3) ... [2025-03-03 21:06:47,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7a43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:06:47, skipping insertion in model container [2025-03-03 21:06:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:06:47" (3/3) ... [2025-03-03 21:06:47,418 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2025-03-03 21:06:47,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:06:47,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:06:47,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:06:47,474 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;@235365a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:06:47,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:06:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 21:06:47,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:47,487 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:47,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:47,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1316386444, now seen corresponding path program 1 times [2025-03-03 21:06:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:06:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248108617] [2025-03-03 21:06:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:06:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:06:47,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:06:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:06:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 21:06:47,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 21:06:47,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:47,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:06:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 21:06:47,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:06:47,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:06:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248108617] [2025-03-03 21:06:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248108617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:06:47,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:06:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:06:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079381269] [2025-03-03 21:06:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:06:47,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:06:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:06:47,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:06:47,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:06:47,811 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:47,826 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2025-03-03 21:06:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:06:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2025-03-03 21:06:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:47,832 INFO L225 Difference]: With dead ends: 143 [2025-03-03 21:06:47,832 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 21:06:47,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:06:47,836 INFO L435 NwaCegarLoop]: 105 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, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:47,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:06:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 21:06:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 21:06:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:06:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2025-03-03 21:06:47,879 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 146 [2025-03-03 21:06:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-03-03 21:06:47,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:06:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2025-03-03 21:06:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 21:06:47,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:47,882 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:47,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:06:48,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:06:48,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 986440330, now seen corresponding path program 1 times [2025-03-03 21:06:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:06:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50876461] [2025-03-03 21:06:48,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:06:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:06:48,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:06:48,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:06:48,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 21:06:48,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 21:06:48,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:48,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:06:48,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 21:06:48,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:06:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:48,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:06:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50876461] [2025-03-03 21:06:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50876461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:06:48,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:06:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 21:06:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368757228] [2025-03-03 21:06:48,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:06:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:06:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:06:48,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:06:48,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:06:48,880 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:06:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:50,166 INFO L93 Difference]: Finished difference Result 155 states and 229 transitions. [2025-03-03 21:06:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:06:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 146 [2025-03-03 21:06:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:50,169 INFO L225 Difference]: With dead ends: 155 [2025-03-03 21:06:50,169 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 21:06:50,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:06:50,170 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 184 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:50,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 195 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:06:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 21:06:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2025-03-03 21:06:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:06:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-03 21:06:50,181 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 146 [2025-03-03 21:06:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:50,181 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-03 21:06:50,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:06:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-03 21:06:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 21:06:50,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:50,182 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:50,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:06:50,387 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-03 21:06:50,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 826277787, now seen corresponding path program 1 times [2025-03-03 21:06:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:06:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222198484] [2025-03-03 21:06:50,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:06:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:06:50,390 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-03 21:06:50,391 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-03 21:06:50,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 21:06:50,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 21:06:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:50,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:06:50,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:06:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-03-03 21:06:50,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:06:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:06:50,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:06:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222198484] [2025-03-03 21:06:50,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222198484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:06:50,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:06:50,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 21:06:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289123700] [2025-03-03 21:06:50,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:06:50,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:06:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:06:50,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:06:50,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:06:50,897 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:06:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:06:52,095 INFO L93 Difference]: Finished difference Result 219 states and 306 transitions. [2025-03-03 21:06:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:06:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 147 [2025-03-03 21:06:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:06:52,098 INFO L225 Difference]: With dead ends: 219 [2025-03-03 21:06:52,099 INFO L226 Difference]: Without dead ends: 149 [2025-03-03 21:06:52,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:06:52,102 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 115 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:06:52,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 346 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:06:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-03 21:06:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 124. [2025-03-03 21:06:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 74 states have internal predecessors, (83), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:06:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2025-03-03 21:06:52,130 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 147 [2025-03-03 21:06:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:06:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2025-03-03 21:06:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:06:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2025-03-03 21:06:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 21:06:52,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:06:52,133 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:06:52,143 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-03 21:06:52,334 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 [2025-03-03 21:06:52,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:06:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:06:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1724955653, now seen corresponding path program 1 times [2025-03-03 21:06:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:06:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858282590] [2025-03-03 21:06:52,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:06:52,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:06:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:06:52,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:06:52,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 21:06:52,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 21:06:52,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 21:06:52,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:06:52,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:06:52,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 21:06:52,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:07:08,245 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 21:07:56,949 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)