./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:44:28,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:44:28,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:44:28,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:44:28,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:44:28,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:44:28,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:44:28,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:44:28,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:44:28,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:44:28,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:44:28,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:44:28,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:44:28,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:44:28,602 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:44:28,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:44:28,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:28,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:44:28,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:44:28,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:44:28,604 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2025-03-08 09:44:28,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:44:28,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:44:28,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:44:28,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:44:28,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:44:28,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:29,940 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eddd18a/e6db913b16b44b3ebbe7539af55655c2/FLAGf112acd43 [2025-03-08 09:44:30,239 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:44:30,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:30,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eddd18a/e6db913b16b44b3ebbe7539af55655c2/FLAGf112acd43 [2025-03-08 09:44:30,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eddd18a/e6db913b16b44b3ebbe7539af55655c2 [2025-03-08 09:44:30,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:44:30,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:44:30,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:30,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:44:30,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:44:30,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218c6182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30, skipping insertion in model container [2025-03-08 09:44:30,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:44:30,449 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c[1259,1272] [2025-03-08 09:44:30,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:30,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:44:30,648 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c[1259,1272] [2025-03-08 09:44:30,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:30,734 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:44:30,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30 WrapperNode [2025-03-08 09:44:30,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:30,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:30,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:44:30,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:44:30,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,933 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2159 [2025-03-08 09:44:30,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:30,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:44:30,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:44:30,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:44:30,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:30,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,036 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:44:31,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:44:31,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:44:31,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:44:31,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:44:31,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (1/1) ... [2025-03-08 09:44:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:31,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:44:31,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:44:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:44:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:44:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:44:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:44:31,412 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:44:31,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:44:33,080 INFO L? ?]: Removed 1352 outVars from TransFormulas that were not future-live. [2025-03-08 09:44:33,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:44:33,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:44:33,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:44:33,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:33 BoogieIcfgContainer [2025-03-08 09:44:33,165 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:44:33,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:44:33,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:44:33,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:44:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:44:30" (1/3) ... [2025-03-08 09:44:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6065dc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:33, skipping insertion in model container [2025-03-08 09:44:33,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:30" (2/3) ... [2025-03-08 09:44:33,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6065dc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:33, skipping insertion in model container [2025-03-08 09:44:33,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:33" (3/3) ... [2025-03-08 09:44:33,172 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:33,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:44:33,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c that has 1 procedures, 547 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:44:33,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:44:33,251 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;@72428bac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:44:33,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:44:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 09:44:33,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:33,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:33,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1183212130, now seen corresponding path program 1 times [2025-03-08 09:44:33,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:33,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776363694] [2025-03-08 09:44:33,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:33,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 09:44:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 09:44:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776363694] [2025-03-08 09:44:33,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776363694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:33,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273489849] [2025-03-08 09:44:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:33,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:33,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:33,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:33,863 INFO L87 Difference]: Start difference. First operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:34,170 INFO L93 Difference]: Finished difference Result 1039 states and 1555 transitions. [2025-03-08 09:44:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:34,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 09:44:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:34,184 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 09:44:34,184 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 09:44:34,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:34,191 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:34,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2026 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 09:44:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2025-03-08 09:44:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.4954128440366972) internal successors, (815), 545 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 815 transitions. [2025-03-08 09:44:34,236 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 815 transitions. Word has length 45 [2025-03-08 09:44:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:34,237 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 815 transitions. [2025-03-08 09:44:34,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 815 transitions. [2025-03-08 09:44:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 09:44:34,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:34,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:44:34,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1979809579, now seen corresponding path program 1 times [2025-03-08 09:44:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354189606] [2025-03-08 09:44:34,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:34,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 09:44:34,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 09:44:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:34,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354189606] [2025-03-08 09:44:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354189606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857057920] [2025-03-08 09:44:34,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:34,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:34,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:34,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:34,411 INFO L87 Difference]: Start difference. First operand 546 states and 815 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:34,657 INFO L93 Difference]: Finished difference Result 1040 states and 1553 transitions. [2025-03-08 09:44:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 09:44:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:34,660 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 09:44:34,660 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 09:44:34,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:34,661 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:34,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 09:44:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-08 09:44:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.493601462522852) internal successors, (817), 547 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 817 transitions. [2025-03-08 09:44:34,676 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 817 transitions. Word has length 46 [2025-03-08 09:44:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:34,676 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 817 transitions. [2025-03-08 09:44:34,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 817 transitions. [2025-03-08 09:44:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 09:44:34,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:34,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:34,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:44:34,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:34,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1118902471, now seen corresponding path program 1 times [2025-03-08 09:44:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396393136] [2025-03-08 09:44:34,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:34,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 09:44:34,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 09:44:34,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396393136] [2025-03-08 09:44:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396393136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296761741] [2025-03-08 09:44:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:35,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:35,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:35,006 INFO L87 Difference]: Start difference. First operand 548 states and 817 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:35,362 INFO L93 Difference]: Finished difference Result 1048 states and 1563 transitions. [2025-03-08 09:44:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-08 09:44:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:35,365 INFO L225 Difference]: With dead ends: 1048 [2025-03-08 09:44:35,365 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 09:44:35,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:35,366 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 2 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:35,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3354 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 09:44:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 553. [2025-03-08 09:44:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4927536231884058) internal successors, (824), 552 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 824 transitions. [2025-03-08 09:44:35,385 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 824 transitions. Word has length 47 [2025-03-08 09:44:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 824 transitions. [2025-03-08 09:44:35,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 824 transitions. [2025-03-08 09:44:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 09:44:35,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:35,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:35,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:44:35,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:35,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1247162379, now seen corresponding path program 1 times [2025-03-08 09:44:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335114280] [2025-03-08 09:44:35,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 09:44:35,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 09:44:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335114280] [2025-03-08 09:44:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335114280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:35,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:35,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563781919] [2025-03-08 09:44:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:35,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:35,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:35,607 INFO L87 Difference]: Start difference. First operand 553 states and 824 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:35,933 INFO L93 Difference]: Finished difference Result 1054 states and 1571 transitions. [2025-03-08 09:44:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 09:44:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:35,936 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 09:44:35,936 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 09:44:35,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:35,937 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:35,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2695 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 09:44:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-08 09:44:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4909747292418774) internal successors, (826), 554 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 826 transitions. [2025-03-08 09:44:35,949 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 826 transitions. Word has length 48 [2025-03-08 09:44:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:35,949 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 826 transitions. [2025-03-08 09:44:35,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 826 transitions. [2025-03-08 09:44:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 09:44:35,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:35,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:35,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:44:35,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:35,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash 794632470, now seen corresponding path program 1 times [2025-03-08 09:44:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407312166] [2025-03-08 09:44:35,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:35,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 09:44:35,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 09:44:35,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:35,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407312166] [2025-03-08 09:44:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407312166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:36,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:44:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552814798] [2025-03-08 09:44:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:36,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:44:36,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:36,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:44:36,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:44:36,302 INFO L87 Difference]: Start difference. First operand 555 states and 826 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:36,686 INFO L93 Difference]: Finished difference Result 1061 states and 1579 transitions. [2025-03-08 09:44:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:44:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 09:44:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:36,688 INFO L225 Difference]: With dead ends: 1061 [2025-03-08 09:44:36,689 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 09:44:36,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:44:36,690 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 785 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:36,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 3330 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 09:44:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 559. [2025-03-08 09:44:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.489247311827957) internal successors, (831), 558 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 831 transitions. [2025-03-08 09:44:36,700 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 831 transitions. Word has length 49 [2025-03-08 09:44:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 831 transitions. [2025-03-08 09:44:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 831 transitions. [2025-03-08 09:44:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 09:44:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:36,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:44:36,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -677975116, now seen corresponding path program 1 times [2025-03-08 09:44:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936199290] [2025-03-08 09:44:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:36,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 09:44:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 09:44:36,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:36,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936199290] [2025-03-08 09:44:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936199290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:36,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315276945] [2025-03-08 09:44:36,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:36,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:36,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:36,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:36,833 INFO L87 Difference]: Start difference. First operand 559 states and 831 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:37,038 INFO L93 Difference]: Finished difference Result 1066 states and 1585 transitions. [2025-03-08 09:44:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 09:44:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:37,041 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 09:44:37,041 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 09:44:37,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:37,043 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:37,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 09:44:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 09:44:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4875) internal successors, (833), 560 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 833 transitions. [2025-03-08 09:44:37,053 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 833 transitions. Word has length 49 [2025-03-08 09:44:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:37,053 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 833 transitions. [2025-03-08 09:44:37,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 833 transitions. [2025-03-08 09:44:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 09:44:37,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:37,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:44:37,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -270732038, now seen corresponding path program 1 times [2025-03-08 09:44:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107476173] [2025-03-08 09:44:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:37,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 09:44:37,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 09:44:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:37,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107476173] [2025-03-08 09:44:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107476173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934871937] [2025-03-08 09:44:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:37,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:37,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:37,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:37,198 INFO L87 Difference]: Start difference. First operand 561 states and 833 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:37,520 INFO L93 Difference]: Finished difference Result 1178 states and 1743 transitions. [2025-03-08 09:44:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 09:44:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:37,522 INFO L225 Difference]: With dead ends: 1178 [2025-03-08 09:44:37,523 INFO L226 Difference]: Without dead ends: 671 [2025-03-08 09:44:37,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:44:37,524 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1076 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:37,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 2670 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-08 09:44:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 569. [2025-03-08 09:44:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4876760563380282) internal successors, (845), 568 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 845 transitions. [2025-03-08 09:44:37,533 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 845 transitions. Word has length 50 [2025-03-08 09:44:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 845 transitions. [2025-03-08 09:44:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 845 transitions. [2025-03-08 09:44:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 09:44:37,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:37,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:37,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:44:37,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:37,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1568333010, now seen corresponding path program 1 times [2025-03-08 09:44:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:37,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760028367] [2025-03-08 09:44:37,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:37,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 09:44:37,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 09:44:37,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:37,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:44:37,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:44:37,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 09:44:37,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 09:44:37,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:44:37,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:44:37,648 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:44:37,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:44:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:44:37,656 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:37,687 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:44:37,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:44:37,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:44:37 BoogieIcfgContainer [2025-03-08 09:44:37,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:44:37,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:44:37,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:44:37,704 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:44:37,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:33" (3/4) ... [2025-03-08 09:44:37,706 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:44:37,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:44:37,707 INFO L158 Benchmark]: Toolchain (without parser) took 7431.04ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.9MB in the beginning and 112.5MB in the end (delta: -560.3kB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2025-03-08 09:44:37,708 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:44:37,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.93ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 68.4MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 09:44:37,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 198.38ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 74.3MB in the end (delta: -6.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-03-08 09:44:37,708 INFO L158 Benchmark]: Boogie Preprocessor took 230.14ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 75.2MB in the end (delta: -836.5kB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-03-08 09:44:37,709 INFO L158 Benchmark]: IcfgBuilder took 1999.88ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 75.2MB in the beginning and 116.0MB in the end (delta: -40.8MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2025-03-08 09:44:37,709 INFO L158 Benchmark]: TraceAbstraction took 4537.01ms. Allocated memory is still 293.6MB. Free memory was 116.0MB in the beginning and 112.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:44:37,709 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 293.6MB. Free memory was 112.5MB in the beginning and 112.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:44:37,710 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 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.93ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 68.4MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 198.38ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 74.3MB in the end (delta: -6.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 230.14ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 75.2MB in the end (delta: -836.5kB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1999.88ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 75.2MB in the beginning and 116.0MB in the end (delta: -40.8MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4537.01ms. Allocated memory is still 293.6MB. Free memory was 116.0MB in the beginning and 112.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 293.6MB. Free memory was 112.5MB in the beginning and 112.5MB in the end (delta: 24.1kB). 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: 21]: 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 bitwiseOr at line 177, overapproximation of bitwiseAnd at line 182. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_80 mask_SORT_80 = (SORT_80)-1 >> (sizeof(SORT_80) * 8 - 32); [L39] const SORT_80 msb_SORT_80 = (SORT_80)1 << (32 - 1); [L41] const SORT_91 mask_SORT_91 = (SORT_91)-1 >> (sizeof(SORT_91) * 8 - 4); [L42] const SORT_91 msb_SORT_91 = (SORT_91)1 << (4 - 1); [L44] const SORT_176 mask_SORT_176 = (SORT_176)-1 >> (sizeof(SORT_176) * 8 - 2); [L45] const SORT_176 msb_SORT_176 = (SORT_176)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_23 = 0; [L52] const SORT_1 var_39 = 1; [L53] const SORT_7 var_59 = 1; [L54] const SORT_7 var_64 = 4; [L55] const SORT_7 var_66 = 5; [L56] const SORT_7 var_70 = 3; [L57] const SORT_80 var_82 = 0; [L58] const SORT_7 var_108 = 7; [L59] const SORT_7 var_113 = 6; [L60] const SORT_3 var_140 = 2; [L61] const SORT_3 var_185 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_173; [L67] SORT_3 input_174; [L68] SORT_3 input_175; [L69] SORT_3 input_184; [L70] SORT_3 input_194; [L71] SORT_3 input_195; [L72] SORT_3 input_196; [L73] SORT_3 input_199; [L74] SORT_3 input_218; [L75] SORT_3 input_219; [L76] SORT_3 input_220; [L77] SORT_3 input_223; [L78] SORT_3 input_225; [L79] SORT_176 input_239; [L80] SORT_176 input_240; [L81] SORT_176 input_241; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L86] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L87] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L88] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L89] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L90] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L91] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L92] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L93] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L94] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L95] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_25_arg_1 = var_23; [L104] state_24 = init_25_arg_1 [L105] SORT_3 init_27_arg_1 = var_23; [L106] state_26 = init_27_arg_1 [L107] SORT_3 init_33_arg_1 = var_23; [L108] state_32 = init_33_arg_1 [L109] SORT_3 init_44_arg_1 = var_23; [L110] state_43 = init_44_arg_1 [L111] SORT_3 init_46_arg_1 = var_23; [L112] state_45 = init_46_arg_1 [L113] SORT_3 init_48_arg_1 = var_23; [L114] state_47 = init_48_arg_1 [L115] SORT_3 init_50_arg_1 = var_23; [L116] state_49 = init_50_arg_1 [L117] SORT_3 init_52_arg_1 = var_23; [L118] state_51 = init_52_arg_1 [L119] SORT_3 init_54_arg_1 = var_23; [L120] state_53 = init_54_arg_1 [L121] SORT_3 init_56_arg_1 = var_23; [L122] state_55 = init_56_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_173 = __VERIFIER_nondet_uchar() [L129] input_174 = __VERIFIER_nondet_uchar() [L130] input_175 = __VERIFIER_nondet_uchar() [L131] input_184 = __VERIFIER_nondet_uchar() [L132] input_194 = __VERIFIER_nondet_uchar() [L133] input_195 = __VERIFIER_nondet_uchar() [L134] input_196 = __VERIFIER_nondet_uchar() [L135] input_199 = __VERIFIER_nondet_uchar() [L136] input_218 = __VERIFIER_nondet_uchar() [L137] input_219 = __VERIFIER_nondet_uchar() [L138] input_220 = __VERIFIER_nondet_uchar() [L139] input_223 = __VERIFIER_nondet_uchar() [L140] input_225 = __VERIFIER_nondet_uchar() [L141] input_239 = __VERIFIER_nondet_uchar() [L142] input_240 = __VERIFIER_nondet_uchar() [L143] input_241 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_15=0, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_11; [L155] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_18_arg_0=0, var_18_arg_1=0, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] EXPR var_18_arg_0 & var_18_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L157] SORT_1 var_22_arg_0 = var_18; [L158] SORT_1 var_22_arg_1 = state_20; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_22_arg_0=0, var_22_arg_1=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L160] SORT_3 var_28_arg_0 = state_24; [L161] SORT_3 var_28_arg_1 = state_26; [L162] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L163] SORT_1 var_29_arg_0 = var_28; [L164] SORT_1 var_29 = ~var_29_arg_0; [L165] SORT_1 var_30_arg_0 = var_22; [L166] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_30_arg_0=0, var_30_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L168] SORT_1 var_31_arg_0 = var_30; [L169] SORT_1 var_31 = ~var_31_arg_0; [L170] SORT_3 var_34_arg_0 = state_32; [L171] SORT_3 var_34_arg_1 = state_26; [L172] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L173] SORT_1 var_35_arg_0 = var_34; [L174] SORT_1 var_35 = ~var_35_arg_0; [L175] SORT_1 var_36_arg_0 = var_31; [L176] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_36_arg_0=-1, var_36_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L178] SORT_1 var_40_arg_0 = var_36; [L179] SORT_1 var_40 = ~var_40_arg_0; [L180] SORT_1 var_41_arg_0 = var_39; [L181] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-254, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L183] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L183] var_41 = var_41 & mask_SORT_1 [L184] SORT_1 bad_42_arg_0 = var_41; [L185] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 547 locations, 817 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1863 mSDsluCounter, 18121 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13402 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3823 IncrementalHoareTripleChecker+Invalid, 3829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 4719 mSDtfsCounter, 3823 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=7, InterpolantAutomatonStates: 35, 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, 7 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:44:37,729 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:44:39,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:44:39,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:44:39,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:44:39,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:44:39,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:44:39,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:44:39,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:44:39,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:44:39,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:44:39,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:44:39,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:44:39,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:44:39,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:44:39,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:39,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:44:39,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:44:39,656 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2025-03-08 09:44:39,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:44:39,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:44:39,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:44:39,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:44:39,907 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:44:39,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:41,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5120422fe/fa1c2e40d0354b7ba790e0d9acdfa743/FLAGc7f7f7c26 [2025-03-08 09:44:41,350 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:44:41,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:41,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5120422fe/fa1c2e40d0354b7ba790e0d9acdfa743/FLAGc7f7f7c26 [2025-03-08 09:44:41,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5120422fe/fa1c2e40d0354b7ba790e0d9acdfa743 [2025-03-08 09:44:41,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:44:41,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:44:41,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:41,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:44:41,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:44:41,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:41" (1/1) ... [2025-03-08 09:44:41,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71498af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:41, skipping insertion in model container [2025-03-08 09:44:41,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:41" (1/1) ... [2025-03-08 09:44:41,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:44:41,800 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c[1259,1272] [2025-03-08 09:44:41,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:41,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:44:41,980 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c[1259,1272] [2025-03-08 09:44:42,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:42,051 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:44:42,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42 WrapperNode [2025-03-08 09:44:42,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:42,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:42,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:44:42,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:44:42,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,122 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1085 [2025-03-08 09:44:42,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:42,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:44:42,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:44:42,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:44:42,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,185 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:44:42,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:44:42,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:44:42,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:44:42,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:44:42,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:42,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:42,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:44:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:44:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:44:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:44:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:44:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:44:42,454 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:44:42,456 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:44:43,424 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-08 09:44:43,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:44:43,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:44:43,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:44:43,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:43 BoogieIcfgContainer [2025-03-08 09:44:43,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:44:43,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:44:43,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:44:43,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:44:43,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:44:41" (1/3) ... [2025-03-08 09:44:43,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a634fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:43, skipping insertion in model container [2025-03-08 09:44:43,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (2/3) ... [2025-03-08 09:44:43,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a634fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:43, skipping insertion in model container [2025-03-08 09:44:43,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:43" (3/3) ... [2025-03-08 09:44:43,438 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-03-08 09:44:43,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:44:43,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:44:43,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:44:43,488 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;@244af06e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:44:43,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:44:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:44:43,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:43,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:44:43,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:44:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:44:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692332858] [2025-03-08 09:44:43,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:43,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:44:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:43,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:44:43,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:44:43,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:44:43,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:44:43,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:43,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:43,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 09:44:43,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:44:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:43,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:44:43,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:44:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692332858] [2025-03-08 09:44:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692332858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349351902] [2025-03-08 09:44:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:43,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:44:43,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:43,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:43,898 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:43,955 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:44:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 09:44:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:43,963 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:44:43,963 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:44:43,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:43,966 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:43,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:44:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:44:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:44:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:44:43,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:44:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:43,985 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:44:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:44:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:44:43,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:43,986 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:43,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:44:44,188 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 [2025-03-08 09:44:44,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:44:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:44:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011670838] [2025-03-08 09:44:44,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:44:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:44,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:44:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:44:44,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:44:44,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:44:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:44,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 09:44:44,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:44:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:45,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:44:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:59,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:44:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011670838] [2025-03-08 09:44:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011670838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:44:59,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:44:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 09:44:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200253139] [2025-03-08 09:44:59,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:44:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:44:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:44:59,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:44:59,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:44:59,765 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:59,902 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 09:44:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 09:44:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:59,903 INFO L225 Difference]: With dead ends: 15 [2025-03-08 09:44:59,903 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 09:44:59,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:44:59,903 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:59,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 09:44:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-08 09:44:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 09:44:59,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 09:44:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:59,906 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 09:44:59,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 09:44:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 09:44:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:59,906 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-08 09:44:59,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:45:00,107 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 [2025-03-08 09:45:00,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:00,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-08 09:45:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:45:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241484983] [2025-03-08 09:45:00,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:45:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:00,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:45:00,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:45:00,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 09:45:00,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 09:45:00,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:45:00,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:00,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 09:45:00,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:05,156 INFO L312 TraceCheckSpWp]: Computing backward predicates...