./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-14.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_codestructure_dependencies_file-14.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 ebb91573b741fd25dda870f19988b9a404139dfa230a4de0f0bd608c37880171 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:33:44,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:33:44,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:33:44,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:33:44,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:33:44,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:33:44,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:33:44,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:33:44,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:33:44,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:33:44,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:33:44,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:33:44,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:33:44,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:33:44,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:33:44,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:33:44,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:33:44,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:33:44,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:44,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:33:44,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:33:44,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:33:44,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:33:44,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:33:44,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:33:44,125 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 -> ebb91573b741fd25dda870f19988b9a404139dfa230a4de0f0bd608c37880171 [2025-03-03 18:33:44,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:33:44,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:33:44,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:33:44,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:33:44,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:33:44,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-14.i [2025-03-03 18:33:45,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae004e53f/3330e6593e124d4bb2efff77c24d277b/FLAGd638f0a35 [2025-03-03 18:33:45,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:33:45,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-14.i [2025-03-03 18:33:45,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae004e53f/3330e6593e124d4bb2efff77c24d277b/FLAGd638f0a35 [2025-03-03 18:33:46,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae004e53f/3330e6593e124d4bb2efff77c24d277b [2025-03-03 18:33:46,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:33:46,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:33:46,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:46,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:33:46,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:33:46,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46, skipping insertion in model container [2025-03-03 18:33:46,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:33:46,159 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_codestructure_dependencies_file-14.i[919,932] [2025-03-03 18:33:46,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:46,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:33:46,224 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_codestructure_dependencies_file-14.i[919,932] [2025-03-03 18:33:46,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:46,271 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:33:46,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46 WrapperNode [2025-03-03 18:33:46,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:46,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:46,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:33:46,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:33:46,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,307 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-03 18:33:46,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:46,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:33:46,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:33:46,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:33:46,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,334 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 18:33:46,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:33:46,357 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:33:46,357 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:33:46,357 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:33:46,358 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (1/1) ... [2025-03-03 18:33:46,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:46,385 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 18:33:46,391 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 18:33:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:33:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:33:46,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:33:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:33:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:33:46,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:33:46,464 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:33:46,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:33:46,713 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:33:46,713 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:33:46,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:33:46,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:33:46,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:46 BoogieIcfgContainer [2025-03-03 18:33:46,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:33:46,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:33:46,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:33:46,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:33:46,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:33:46" (1/3) ... [2025-03-03 18:33:46,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e569b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:46, skipping insertion in model container [2025-03-03 18:33:46,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:46" (2/3) ... [2025-03-03 18:33:46,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e569b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:46, skipping insertion in model container [2025-03-03 18:33:46,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:46" (3/3) ... [2025-03-03 18:33:46,730 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-14.i [2025-03-03 18:33:46,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:33:46,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-14.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:33:46,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:33:46,790 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;@a9795ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:33:46,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:33:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:33:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:33:46,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:46,804 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:46,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:46,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1469068013, now seen corresponding path program 1 times [2025-03-03 18:33:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-03-03 18:33:46,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:46,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:46,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:46,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:46,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 18:33:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-03-03 18:33:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193850228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:33:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869985134] [2025-03-03 18:33:47,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:47,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:47,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:47,091 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 18:33:47,093 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 18:33:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:47,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:47,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:47,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:47,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:33:47,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 18:33:47,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:33:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869985134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:33:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:33:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618634802] [2025-03-03 18:33:47,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:33:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:33:47,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:33:47,278 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:47,292 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2025-03-03 18:33:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:33:47,293 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2025-03-03 18:33:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:47,297 INFO L225 Difference]: With dead ends: 120 [2025-03-03 18:33:47,297 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 18:33:47,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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 18:33:47,301 INFO L435 NwaCegarLoop]: 92 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, 92 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 18:33:47,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:33:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 18:33:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 18:33:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:33:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2025-03-03 18:33:47,331 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2025-03-03 18:33:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:47,331 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2025-03-03 18:33:47,331 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2025-03-03 18:33:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:33:47,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:47,335 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:47,343 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 18:33:47,535 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 18:33:47,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:47,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash 483543160, now seen corresponding path program 1 times [2025-03-03 18:33:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:47,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925697733] [2025-03-03 18:33:47,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:47,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:47,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:47,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:47,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:33:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793902693] [2025-03-03 18:33:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:47,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:47,721 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 18:33:47,722 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 18:33:47,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:47,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 18:33:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-03 18:33:48,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:33:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:48,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925697733] [2025-03-03 18:33:48,336 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:33:48,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793902693] [2025-03-03 18:33:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793902693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:33:48,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:33:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 18:33:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213269740] [2025-03-03 18:33:48,337 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:33:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:48,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:48,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:33:48,339 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:48,666 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2025-03-03 18:33:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:33:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2025-03-03 18:33:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:48,668 INFO L225 Difference]: With dead ends: 214 [2025-03-03 18:33:48,668 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 18:33:48,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:33:48,669 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 100 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:48,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 18:33:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-03-03 18:33:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.25) internal successors, (100), 81 states have internal predecessors, (100), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 18:33:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2025-03-03 18:33:48,711 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 142 [2025-03-03 18:33:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2025-03-03 18:33:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2025-03-03 18:33:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:33:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:48,716 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:48,723 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 18:33:48,917 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,SelfDestructingSolverStorable1 [2025-03-03 18:33:48,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1371046841, now seen corresponding path program 1 times [2025-03-03 18:33:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244784544] [2025-03-03 18:33:48,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:48,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:49,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:49,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:33:49,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105343958] [2025-03-03 18:33:49,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:49,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:49,045 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 18:33:49,047 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 18:33:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:33:49,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:33:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:49,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 18:33:49,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 18:33:49,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:33:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244784544] [2025-03-03 18:33:49,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:33:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105343958] [2025-03-03 18:33:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105343958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:33:49,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:33:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 18:33:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729661612] [2025-03-03 18:33:49,642 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:33:49,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:49,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:49,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:33:49,643 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:49,930 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2025-03-03 18:33:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:33:49,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2025-03-03 18:33:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:49,933 INFO L225 Difference]: With dead ends: 287 [2025-03-03 18:33:49,933 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 18:33:49,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:49,938 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 87 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:49,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 343 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 18:33:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-03-03 18:33:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 83 states have internal predecessors, (101), 61 states have call successors, (61), 5 states have call predecessors, (61), 5 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 18:33:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2025-03-03 18:33:49,968 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 142 [2025-03-03 18:33:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:49,968 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2025-03-03 18:33:49,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:33:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2025-03-03 18:33:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 18:33:49,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:49,971 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:49,978 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 18:33:50,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:50,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:50,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1429602380, now seen corresponding path program 1 times [2025-03-03 18:33:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060177621] [2025-03-03 18:33:50,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:50,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:33:50,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:33:50,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:50,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 18:33:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060177621] [2025-03-03 18:33:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060177621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:50,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:33:50,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119370925] [2025-03-03 18:33:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:50,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:33:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:50,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:33:50,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:50,565 INFO L87 Difference]: Start difference. First operand 149 states and 223 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:33:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:50,704 INFO L93 Difference]: Finished difference Result 413 states and 611 transitions. [2025-03-03 18:33:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:33:50,705 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-03-03 18:33:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:50,709 INFO L225 Difference]: With dead ends: 413 [2025-03-03 18:33:50,709 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 18:33:50,711 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 18:33:50,712 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 68 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:50,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:33:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 18:33:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 270. [2025-03-03 18:33:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 152 states have (on average 1.230263157894737) internal successors, (187), 153 states have internal predecessors, (187), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-03 18:33:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 401 transitions. [2025-03-03 18:33:50,770 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 401 transitions. Word has length 143 [2025-03-03 18:33:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:50,771 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 401 transitions. [2025-03-03 18:33:50,771 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:33:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 401 transitions. [2025-03-03 18:33:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 18:33:50,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:50,773 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:33:50,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:50,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1626115885, now seen corresponding path program 1 times [2025-03-03 18:33:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324933812] [2025-03-03 18:33:50,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:33:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:33:50,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:50,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:33:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045239794] [2025-03-03 18:33:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:50,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:33:50,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:33:50,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:33:50,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:33:50,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:50,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:50,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:33:50,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:33:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:33:51,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:51,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:33:51,077 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:33:51,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:33:51,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 18:33:51,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:51,282 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:33:51,372 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:33:51,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:33:51 BoogieIcfgContainer [2025-03-03 18:33:51,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:33:51,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:33:51,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:33:51,377 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:33:51,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:46" (3/4) ... [2025-03-03 18:33:51,379 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:33:51,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:33:51,380 INFO L158 Benchmark]: Toolchain (without parser) took 5327.21ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.5MB in the beginning and 132.6MB in the end (delta: -27.1MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2025-03-03 18:33:51,380 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:51,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.18ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:33:51,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.62ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:51,382 INFO L158 Benchmark]: Boogie Preprocessor took 47.96ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 82.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:51,383 INFO L158 Benchmark]: IcfgBuilder took 363.94ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 59.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:33:51,383 INFO L158 Benchmark]: TraceAbstraction took 4652.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 57.9MB in the beginning and 132.6MB in the end (delta: -74.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-03-03 18:33:51,383 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 318.8MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:51,385 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.18ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.62ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 87.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.96ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 82.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 363.94ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 59.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4652.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 57.9MB in the beginning and 132.6MB in the end (delta: -74.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 318.8MB. Free memory is still 132.6MB. 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 70, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -10; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 0; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 1; [L28] unsigned long int var_1_11 = 16; [L29] signed short int var_1_12 = -32; [L30] unsigned char var_1_15 = 8; [L31] unsigned char var_1_17 = 100; [L32] unsigned char var_1_18 = 10; [L33] signed long int var_1_19 = 1; [L34] unsigned char var_1_20 = 5; [L35] float var_1_21 = 25.5; [L36] signed long int var_1_23 = -5; [L37] float var_1_24 = 1.125; [L38] float var_1_25 = 15.25; [L39] signed long int var_1_26 = 5; [L40] unsigned char var_1_28 = 16; [L41] unsigned char last_1_var_1_4 = 0; [L42] unsigned char last_1_var_1_15 = 8; [L43] signed long int last_1_var_1_19 = 1; [L44] float last_1_var_1_21 = 25.5; [L45] signed long int last_1_var_1_26 = 5; [L46] unsigned char last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L124] last_1_var_1_4 = var_1_4 [L125] last_1_var_1_15 = var_1_15 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_21 = var_1_21 [L128] last_1_var_1_26 = var_1_26 [L129] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L139] RET updateLastVariables() [L140] CALL updateVariables() [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] var_1_8 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L97] var_1_10 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L100] var_1_12 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L102] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L107] var_1_18 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 255) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L114] var_1_23 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L118] var_1_24 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L120] var_1_25 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L140] RET updateVariables() [L141] CALL step() [L50] COND FALSE !((last_1_var_1_28 / var_1_12) <= last_1_var_1_19) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L53] COND TRUE ((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L54] COND FALSE !(\read(last_1_var_1_4)) [L57] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L60] var_1_1 = (var_1_15 + var_1_15) [L61] var_1_28 = var_1_17 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L62] COND TRUE var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4) [L63] var_1_26 = (var_1_28 - var_1_20) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=51/2, var_1_23=-1, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L67] COND TRUE ((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23) [L68] var_1_21 = ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_21 + 9.999999999999994E14f) < (- var_1_21) [L71] var_1_4 = (var_1_7 && var_1_8) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L77] COND FALSE !((var_1_15 % var_1_20) != var_1_1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((var_1_1 == ((signed long int) (var_1_15 + var_1_15))) && (((var_1_21 + 9.999999999999994E14f) < (- var_1_21)) ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_7 ? (var_1_4 == ((unsigned char) ((var_1_8 || var_1_9) && var_1_10))) : 1))) && (((last_1_var_1_28 / var_1_12) <= last_1_var_1_19) ? (var_1_11 == ((unsigned long int) ((((last_1_var_1_28) > (last_1_var_1_15)) ? (last_1_var_1_28) : (last_1_var_1_15))))) : 1)) && ((((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21)) ? (last_1_var_1_4 ? (var_1_15 == ((unsigned char) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) < (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_15 == ((unsigned char) var_1_18))) : 1)) && (((var_1_15 % var_1_20) != var_1_1) ? ((var_1_18 == var_1_17) ? (var_1_4 ? (var_1_19 == ((signed long int) var_1_18)) : (var_1_19 == ((signed long int) var_1_26))) : 1) : 1)) && ((((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23)) ? (var_1_21 == ((float) ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))))) : 1)) && ((var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4)) ? (var_1_26 == ((signed long int) (var_1_28 - var_1_20))) : (var_1_26 == ((signed long int) (var_1_20 - var_1_17))))) && (var_1_28 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=8, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=8, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=-7, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 1047 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 678 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 369 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 1948 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1015 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4995/5060 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 18:33:51,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_dependencies_file-14.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 ebb91573b741fd25dda870f19988b9a404139dfa230a4de0f0bd608c37880171 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:33:53,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:33:53,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:33:53,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:33:53,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:33:53,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:33:53,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:33:53,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:33:53,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:33:53,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:33:53,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:33:53,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:33:53,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:33:53,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:33:53,345 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:33:53,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:33:53,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:33:53,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:53,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:33:53,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:33:53,347 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 -> ebb91573b741fd25dda870f19988b9a404139dfa230a4de0f0bd608c37880171 [2025-03-03 18:33:53,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:33:53,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:33:53,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:33:53,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:33:53,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:33:53,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-14.i [2025-03-03 18:33:54,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc8c9787/114dcf043c72440eb91d8486e6110c0f/FLAG119e0f4ae [2025-03-03 18:33:54,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:33:54,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-14.i [2025-03-03 18:33:54,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc8c9787/114dcf043c72440eb91d8486e6110c0f/FLAG119e0f4ae [2025-03-03 18:33:54,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc8c9787/114dcf043c72440eb91d8486e6110c0f [2025-03-03 18:33:54,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:33:54,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:33:54,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:54,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:33:54,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:33:54,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:54" (1/1) ... [2025-03-03 18:33:54,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1112d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:54, skipping insertion in model container [2025-03-03 18:33:54,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:54" (1/1) ... [2025-03-03 18:33:54,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:33:55,053 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_codestructure_dependencies_file-14.i[919,932] [2025-03-03 18:33:55,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:55,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:33:55,136 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_codestructure_dependencies_file-14.i[919,932] [2025-03-03 18:33:55,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:55,184 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:33:55,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55 WrapperNode [2025-03-03 18:33:55,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:55,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:55,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:33:55,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:33:55,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,222 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-03 18:33:55,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:55,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:33:55,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:33:55,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:33:55,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,249 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 18:33:55,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:33:55,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:33:55,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:33:55,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:33:55,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (1/1) ... [2025-03-03 18:33:55,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:55,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:55,300 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 18:33:55,302 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 18:33:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:33:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:33:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:33:55,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:33:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:33:55,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:33:55,370 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:33:55,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:34:04,289 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:34:04,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:34:04,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:34:04,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:34:04,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:04 BoogieIcfgContainer [2025-03-03 18:34:04,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:34:04,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:34:04,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:34:04,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:34:04,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:33:54" (1/3) ... [2025-03-03 18:34:04,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb49ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:04, skipping insertion in model container [2025-03-03 18:34:04,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:55" (2/3) ... [2025-03-03 18:34:04,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb49ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:04, skipping insertion in model container [2025-03-03 18:34:04,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:04" (3/3) ... [2025-03-03 18:34:04,306 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-14.i [2025-03-03 18:34:04,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:34:04,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-14.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:34:04,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:34:04,358 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;@13f42aba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:34:04,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:34:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:34:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:34:04,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:04,369 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:34:04,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:04,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1469068013, now seen corresponding path program 1 times [2025-03-03 18:34:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:34:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113456151] [2025-03-03 18:34:04,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:04,383 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 18:34:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:34:04,385 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 18:34:04,386 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 18:34:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:34:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:34:04,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:04,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:04,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:34:04,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:34:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 18:34:04,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:34:04,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:34:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113456151] [2025-03-03 18:34:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113456151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:34:04,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:34:04,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:34:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158063316] [2025-03-03 18:34:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:34:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:34:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:34:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:34:04,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:34:04,789 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:34:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:34:04,808 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2025-03-03 18:34:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:34:04,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2025-03-03 18:34:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:34:04,814 INFO L225 Difference]: With dead ends: 120 [2025-03-03 18:34:04,814 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 18:34:04,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 18:34:04,820 INFO L435 NwaCegarLoop]: 92 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, 92 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 18:34:04,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:34:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 18:34:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 18:34:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:34:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2025-03-03 18:34:04,855 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2025-03-03 18:34:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:34:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2025-03-03 18:34:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:34:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2025-03-03 18:34:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:34:04,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:04,860 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:34:04,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 18:34:05,060 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 18:34:05,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:05,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 483543160, now seen corresponding path program 1 times [2025-03-03 18:34:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:34:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551764325] [2025-03-03 18:34:05,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:05,063 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 18:34:05,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:34:05,065 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 18:34:05,067 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 18:34:05,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:34:05,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:34:05,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:05,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:05,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 18:34:05,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:34:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 18:34:18,580 INFO L312 TraceCheckSpWp]: Computing backward predicates...