./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-90.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_normal_file-90.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 7db13a7e26cbc183bd46d6ea9e4489d051a6249f7cd21ccc54b8d0eaab5a8cf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:19:17,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:19:17,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:19:17,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:19:17,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:19:17,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:19:17,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:19:17,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:19:17,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:19:17,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:19:17,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:19:17,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:19:17,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:19:17,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:19:17,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:19:17,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:19:17,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:19:17,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:19:17,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:19:17,488 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 -> 7db13a7e26cbc183bd46d6ea9e4489d051a6249f7cd21ccc54b8d0eaab5a8cf4 [2025-03-03 22:19:17,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:19:17,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:19:17,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:19:17,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:19:17,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:19:17,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:18,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86885df78/70bb0afc1aa54b86b0204adc6d427435/FLAG56548fb63 [2025-03-03 22:19:19,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:19:19,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:19,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86885df78/70bb0afc1aa54b86b0204adc6d427435/FLAG56548fb63 [2025-03-03 22:19:19,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86885df78/70bb0afc1aa54b86b0204adc6d427435 [2025-03-03 22:19:19,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:19:19,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:19:19,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:19:19,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:19:19,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:19:19,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c494e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19, skipping insertion in model container [2025-03-03 22:19:19,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:19:19,544 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_normal_file-90.i[913,926] [2025-03-03 22:19:19,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:19:19,588 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:19:19,595 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_normal_file-90.i[913,926] [2025-03-03 22:19:19,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:19:19,617 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:19:19,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19 WrapperNode [2025-03-03 22:19:19,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:19:19,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:19:19,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:19:19,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:19:19,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,659 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-03 22:19:19,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:19:19,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:19:19,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:19:19,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:19:19,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,682 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 22:19:19,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:19:19,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:19:19,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:19:19,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:19:19,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (1/1) ... [2025-03-03 22:19:19,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:19:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:19:19,724 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 22:19:19,729 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 22:19:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:19:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:19:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:19:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:19:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:19:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:19:19,805 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:19:19,806 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:19:20,004 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~bitwise14#1; [2025-03-03 22:19:20,029 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 22:19:20,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:19:20,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:19:20,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:19:20,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:19:20 BoogieIcfgContainer [2025-03-03 22:19:20,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:19:20,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:19:20,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:19:20,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:19:20,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:19:19" (1/3) ... [2025-03-03 22:19:20,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a73a97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:19:20, skipping insertion in model container [2025-03-03 22:19:20,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:19" (2/3) ... [2025-03-03 22:19:20,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a73a97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:19:20, skipping insertion in model container [2025-03-03 22:19:20,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:19:20" (3/3) ... [2025-03-03 22:19:20,056 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:20,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:19:20,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-90.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:19:20,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:19:20,122 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;@7789b0b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:19:20,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:19:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:19:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 22:19:20,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:20,135 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:20,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:20,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -868108347, now seen corresponding path program 1 times [2025-03-03 22:19:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:19:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650037089] [2025-03-03 22:19:20,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:19:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 22:19:20,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 22:19:20,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:19:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:19:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650037089] [2025-03-03 22:19:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650037089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:19:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785269459] [2025-03-03 22:19:20,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:20,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:19:20,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:19:20,365 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 22:19:20,367 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 22:19:20,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 22:19:20,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 22:19:20,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:20,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:20,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:19:20,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:19:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:19:20,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:19:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785269459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:19:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:19:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:19:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948724954] [2025-03-03 22:19:20,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:19:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:19:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:19:20,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:19:20,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:19:20,547 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:19:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:19:20,565 INFO L93 Difference]: Finished difference Result 122 states and 209 transitions. [2025-03-03 22:19:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:19:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-03-03 22:19:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:19:20,570 INFO L225 Difference]: With dead ends: 122 [2025-03-03 22:19:20,570 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 22:19:20,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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 22:19:20,574 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:19:20,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:19:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 22:19:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 22:19:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:19:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-03 22:19:20,600 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 118 [2025-03-03 22:19:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:19:20,600 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-03 22:19:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:19:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-03 22:19:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 22:19:20,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:20,604 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:20,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:19:20,805 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 22:19:20,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:20,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1674362665, now seen corresponding path program 1 times [2025-03-03 22:19:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:19:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199326853] [2025-03-03 22:19:20,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:19:20,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 22:19:20,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 22:19:20,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:20,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:19:21,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:19:21,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199326853] [2025-03-03 22:19:21,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199326853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:19:21,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:19:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:19:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807375271] [2025-03-03 22:19:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:19:21,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:19:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:19:21,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:19:21,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:19:21,345 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:19:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:19:21,524 INFO L93 Difference]: Finished difference Result 178 states and 274 transitions. [2025-03-03 22:19:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:19:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-03-03 22:19:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:19:21,527 INFO L225 Difference]: With dead ends: 178 [2025-03-03 22:19:21,527 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 22:19:21,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:19:21,528 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:19:21,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 239 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:19:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 22:19:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2025-03-03 22:19:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:19:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-03-03 22:19:21,558 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 118 [2025-03-03 22:19:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:19:21,558 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-03-03 22:19:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:19:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-03-03 22:19:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 22:19:21,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:21,560 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:19:21,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1976967649, now seen corresponding path program 1 times [2025-03-03 22:19:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:19:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020777293] [2025-03-03 22:19:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:19:21,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 22:19:21,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 22:19:21,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:19:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:19:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020777293] [2025-03-03 22:19:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020777293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:19:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:19:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:19:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116089708] [2025-03-03 22:19:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:19:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:19:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:19:21,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:19:21,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:19:21,735 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:19:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:19:21,880 INFO L93 Difference]: Finished difference Result 254 states and 392 transitions. [2025-03-03 22:19:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:19:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-03-03 22:19:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:19:21,882 INFO L225 Difference]: With dead ends: 254 [2025-03-03 22:19:21,883 INFO L226 Difference]: Without dead ends: 182 [2025-03-03 22:19:21,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:19:21,884 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:19:21,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 253 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:19:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-03 22:19:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2025-03-03 22:19:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 22:19:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2025-03-03 22:19:21,914 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 120 [2025-03-03 22:19:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:19:21,914 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2025-03-03 22:19:21,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:19:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2025-03-03 22:19:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 22:19:21,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:21,917 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:21,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:19:21,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2081826440, now seen corresponding path program 1 times [2025-03-03 22:19:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:19:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515187234] [2025-03-03 22:19:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:19:21,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 22:19:21,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 22:19:21,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 22:19:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:19:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515187234] [2025-03-03 22:19:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515187234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:19:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430565784] [2025-03-03 22:19:22,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:19:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:19:22,213 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 22:19:22,214 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 22:19:22,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 22:19:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 22:19:22,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:22,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:22,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:19:22,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:19:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 22:19:22,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:19:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 22:19:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430565784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:19:22,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:19:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2025-03-03 22:19:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055274052] [2025-03-03 22:19:22,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:19:22,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:19:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:19:22,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:19:22,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:19:22,952 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-03 22:19:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:19:23,203 INFO L93 Difference]: Finished difference Result 342 states and 498 transitions. [2025-03-03 22:19:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:19:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 122 [2025-03-03 22:19:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:19:23,207 INFO L225 Difference]: With dead ends: 342 [2025-03-03 22:19:23,207 INFO L226 Difference]: Without dead ends: 214 [2025-03-03 22:19:23,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2025-03-03 22:19:23,208 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:19:23,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 205 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:19:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-03 22:19:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2025-03-03 22:19:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 22:19:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions. [2025-03-03 22:19:23,254 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 122 [2025-03-03 22:19:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:19:23,254 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 279 transitions. [2025-03-03 22:19:23,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-03 22:19:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions. [2025-03-03 22:19:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 22:19:23,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:23,258 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:23,264 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 22:19:23,461 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,SelfDestructingSolverStorable3 [2025-03-03 22:19:23,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:23,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1788423433, now seen corresponding path program 1 times [2025-03-03 22:19:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:19:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851440112] [2025-03-03 22:19:23,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:19:23,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 22:19:23,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 22:19:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:19:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807345822] [2025-03-03 22:19:23,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:23,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:19:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:19:23,536 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 22:19:23,538 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 22:19:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 22:19:23,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 22:19:23,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:23,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:19:23,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:19:23,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 22:19:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 22:19:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:19:23,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:19:23,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:19:23,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:19:23,851 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 22:19:24,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:19:24,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 22:19:24,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:19:24,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:19:24 BoogieIcfgContainer [2025-03-03 22:19:24,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:19:24,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:19:24,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:19:24,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:19:24,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:19:20" (3/4) ... [2025-03-03 22:19:24,114 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:19:24,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:19:24,116 INFO L158 Benchmark]: Toolchain (without parser) took 4676.74ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 103.9MB in the beginning and 165.7MB in the end (delta: -61.8MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2025-03-03 22:19:24,116 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:19:24,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.43ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 91.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:19:24,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.66ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:19:24,118 INFO L158 Benchmark]: Boogie Preprocessor took 32.18ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:19:24,118 INFO L158 Benchmark]: IcfgBuilder took 352.48ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 66.2MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:19:24,118 INFO L158 Benchmark]: TraceAbstraction took 4060.66ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.0MB in the beginning and 165.7MB in the end (delta: -100.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2025-03-03 22:19:24,118 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 335.5MB. Free memory was 165.7MB in the beginning and 165.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:19:24,119 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.13ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.43ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 91.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.66ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.18ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.48ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 66.2MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4060.66ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.0MB in the beginning and 165.7MB in the end (delta: -100.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 335.5MB. Free memory was 165.7MB in the beginning and 165.7MB in the end (delta: 41.6kB). 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 someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of bitwiseOr at line 128, overapproximation of bitwiseOr at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -32; [L23] signed long int var_1_3 = 10; [L24] signed long int var_1_4 = 64; [L25] unsigned short int var_1_11 = 64; [L26] unsigned short int var_1_12 = 8; [L27] unsigned short int var_1_13 = 5; [L28] signed short int var_1_14 = 8; [L29] unsigned short int var_1_15 = 62763; [L30] unsigned long int var_1_16 = 25; [L31] float var_1_18 = 63.25; [L32] unsigned char var_1_20 = 0; [L33] float var_1_21 = 7.8; [L34] float var_1_22 = 32.1; [L35] unsigned char var_1_23 = 0; [L36] signed long int var_1_24 = -16; [L37] signed long int last_1_var_1_1 = -32; [L38] unsigned short int last_1_var_1_11 = 64; [L39] signed short int last_1_var_1_14 = 8; [L40] unsigned long int last_1_var_1_16 = 25; [L41] float last_1_var_1_18 = 63.25; VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L121] last_1_var_1_1 = var_1_1 [L122] last_1_var_1_11 = var_1_11 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_16 = var_1_16 [L125] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L93] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L96] var_1_4 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L97] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L98] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L98] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L99] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L99] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L101] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L102] CALL assume_abort_if_not(var_1_12 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L102] RET assume_abort_if_not(var_1_12 <= 16384) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L105] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L105] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L106] var_1_15 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L107] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L108] CALL assume_abort_if_not(var_1_15 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L108] RET assume_abort_if_not(var_1_15 <= 65535) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L109] var_1_20 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L111] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L111] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L112] var_1_21 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L113] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L114] var_1_22 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && 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_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L115] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && 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_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L116] var_1_23 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L117] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L118] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L118] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L136] RET updateVariables() [L137] CALL step() [L45] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) [L52] var_1_1 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-1] [L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18) [L61] var_1_24 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L66] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, stepLocal_0=0, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=-255, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L67] COND FALSE !(var_1_24 < stepLocal_0) [L78] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L80] COND TRUE var_1_18 != (var_1_18 + var_1_18) [L81] var_1_11 = ((var_1_12 + var_1_13) + 32) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L83] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1) [L88] var_1_16 = 0u VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L128-L129] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=-255, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 788 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 456 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 332 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=4, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 2802 SizeOfPredicates, 3 NumberOfNonLiveVariables, 586 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 4103/4284 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 22:19:24,137 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_normal_file-90.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 7db13a7e26cbc183bd46d6ea9e4489d051a6249f7cd21ccc54b8d0eaab5a8cf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:19:25,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:19:26,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:19:26,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:19:26,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:19:26,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:19:26,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:19:26,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:19:26,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:19:26,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:19:26,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:19:26,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:19:26,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:19:26,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:19:26,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:19:26,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:19:26,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:19:26,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:19:26,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:19:26,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:19:26,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:19:26,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:19:26,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:19:26,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:19:26,069 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 -> 7db13a7e26cbc183bd46d6ea9e4489d051a6249f7cd21ccc54b8d0eaab5a8cf4 [2025-03-03 22:19:26,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:19:26,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:19:26,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:19:26,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:19:26,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:19:26,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:27,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab771c2c/2e08bbfd721743d9afaf577d91c10a02/FLAG2599fc1e0 [2025-03-03 22:19:27,653 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:19:27,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:27,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab771c2c/2e08bbfd721743d9afaf577d91c10a02/FLAG2599fc1e0 [2025-03-03 22:19:28,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab771c2c/2e08bbfd721743d9afaf577d91c10a02 [2025-03-03 22:19:28,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:19:28,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:19:28,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:19:28,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:19:28,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:19:28,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cebb1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28, skipping insertion in model container [2025-03-03 22:19:28,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:19:28,138 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_normal_file-90.i[913,926] [2025-03-03 22:19:28,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:19:28,181 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:19:28,189 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_normal_file-90.i[913,926] [2025-03-03 22:19:28,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:19:28,217 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:19:28,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28 WrapperNode [2025-03-03 22:19:28,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:19:28,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:19:28,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:19:28,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:19:28,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,255 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-03-03 22:19:28,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:19:28,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:19:28,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:19:28,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:19:28,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,279 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 22:19:28,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:19:28,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:19:28,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:19:28,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:19:28,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (1/1) ... [2025-03-03 22:19:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:19:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:19:28,335 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 22:19:28,337 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 22:19:28,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:19:28,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:19:28,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:19:28,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:19:28,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:19:28,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:19:28,409 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:19:28,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:19:29,199 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:19:29,199 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:19:29,207 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:19:29,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:19:29,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:19:29 BoogieIcfgContainer [2025-03-03 22:19:29,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:19:29,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:19:29,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:19:29,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:19:29,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:19:28" (1/3) ... [2025-03-03 22:19:29,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303e92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:19:29, skipping insertion in model container [2025-03-03 22:19:29,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:19:28" (2/3) ... [2025-03-03 22:19:29,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303e92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:19:29, skipping insertion in model container [2025-03-03 22:19:29,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:19:29" (3/3) ... [2025-03-03 22:19:29,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-90.i [2025-03-03 22:19:29,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:19:29,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-90.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:19:29,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:19:29,262 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;@1325fc82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:19:29,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:19:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:19:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:19:29,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:29,272 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:29,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:29,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 603858526, now seen corresponding path program 1 times [2025-03-03 22:19:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:19:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120542923] [2025-03-03 22:19:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:29,283 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 22:19:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:19:29,285 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 22:19:29,287 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 22:19:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:19:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:19:29,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:29,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:29,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:19:29,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:19:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-03 22:19:29,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:19:29,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:19:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120542923] [2025-03-03 22:19:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120542923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:19:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:19:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:19:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342960607] [2025-03-03 22:19:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:19:29,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:19:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:19:29,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:19:29,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:19:29,600 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:19:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:19:29,617 INFO L93 Difference]: Finished difference Result 108 states and 187 transitions. [2025-03-03 22:19:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:19:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-03-03 22:19:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:19:29,621 INFO L225 Difference]: With dead ends: 108 [2025-03-03 22:19:29,621 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 22:19:29,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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 22:19:29,625 INFO L435 NwaCegarLoop]: 82 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, 82 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 22:19:29,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:19:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 22:19:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 22:19:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:19:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2025-03-03 22:19:29,653 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 115 [2025-03-03 22:19:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:19:29,653 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2025-03-03 22:19:29,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:19:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2025-03-03 22:19:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:19:29,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:19:29,658 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:29,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:19:29,858 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 22:19:29,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:19:29,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:19:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 887814522, now seen corresponding path program 1 times [2025-03-03 22:19:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:19:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690903509] [2025-03-03 22:19:29,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:29,860 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 22:19:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:19:29,863 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 22:19:29,864 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 22:19:29,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:19:30,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:19:30,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:30,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:30,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 22:19:30,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:19:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 22:19:30,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:19:31,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:19:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690903509] [2025-03-03 22:19:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690903509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:19:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1551273774] [2025-03-03 22:19:31,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:19:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:19:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:19:31,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:19:31,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:19:31,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:19:31,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:19:31,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:19:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:19:31,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 22:19:31,796 INFO L279 TraceCheckSpWp]: Computing forward predicates...