./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.mul9.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 a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:11:20,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:11:20,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:11:20,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:11:20,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:11:20,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:11:20,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:11:20,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:11:20,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:11:20,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:11:20,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:11:20,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:11:20,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:11:20,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:11:20,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:11:20,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:11:20,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:20,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:11:20,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:11:20,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:11:20,984 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 -> a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab [2025-03-16 22:11:21,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:11:21,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:11:21,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:11:21,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:11:21,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:11:21,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-16 22:11:22,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a04669bf/a9bb86147ecf44e4a563c1b838949697/FLAG7b53b9b38 [2025-03-16 22:11:22,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:11:22,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-16 22:11:22,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a04669bf/a9bb86147ecf44e4a563c1b838949697/FLAG7b53b9b38 [2025-03-16 22:11:22,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a04669bf/a9bb86147ecf44e4a563c1b838949697 [2025-03-16 22:11:22,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:11:22,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:11:22,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:22,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:11:22,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:11:22,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:22" (1/1) ... [2025-03-16 22:11:22,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:22, skipping insertion in model container [2025-03-16 22:11:22,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:22" (1/1) ... [2025-03-16 22:11:22,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:11:22,899 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.mul9.c[1244,1257] [2025-03-16 22:11:23,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:23,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:11:23,032 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.mul9.c[1244,1257] [2025-03-16 22:11:23,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:23,137 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:11:23,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23 WrapperNode [2025-03-16 22:11:23,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:23,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:23,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:11:23,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:11:23,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,258 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1761 [2025-03-16 22:11:23,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:23,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:11:23,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:11:23,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:11:23,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,338 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 22:11:23,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:11:23,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:11:23,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:11:23,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:11:23,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (1/1) ... [2025-03-16 22:11:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:23,476 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-16 22:11:23,478 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-16 22:11:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:11:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:11:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 22:11:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:11:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:11:23,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:11:23,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:11:25,142 INFO L? ?]: Removed 894 outVars from TransFormulas that were not future-live. [2025-03-16 22:11:25,142 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:11:25,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:11:25,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:11:25,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:25 BoogieIcfgContainer [2025-03-16 22:11:25,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:11:25,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:11:25,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:11:25,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:11:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:11:22" (1/3) ... [2025-03-16 22:11:25,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:25, skipping insertion in model container [2025-03-16 22:11:25,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:23" (2/3) ... [2025-03-16 22:11:25,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:25, skipping insertion in model container [2025-03-16 22:11:25,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:25" (3/3) ... [2025-03-16 22:11:25,224 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul9.c [2025-03-16 22:11:25,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:11:25,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul9.c that has 1 procedures, 521 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:11:25,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:11:25,306 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;@968fbc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:11:25,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:11:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 519 states have (on average 1.51252408477842) internal successors, (785), 520 states have internal predecessors, (785), 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-16 22:11:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 22:11:25,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:25,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:25,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:25,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash -109109535, now seen corresponding path program 1 times [2025-03-16 22:11:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470314140] [2025-03-16 22:11:25,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:25,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 22:11:25,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 22:11:25,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:26,162 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-16 22:11:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470314140] [2025-03-16 22:11:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470314140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:26,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:26,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335029380] [2025-03-16 22:11:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:26,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:26,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:26,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:26,186 INFO L87 Difference]: Start difference. First operand has 521 states, 519 states have (on average 1.51252408477842) internal successors, (785), 520 states have internal predecessors, (785), 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 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-16 22:11:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:26,496 INFO L93 Difference]: Finished difference Result 925 states and 1397 transitions. [2025-03-16 22:11:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 94 [2025-03-16 22:11:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:26,509 INFO L225 Difference]: With dead ends: 925 [2025-03-16 22:11:26,510 INFO L226 Difference]: Without dead ends: 521 [2025-03-16 22:11:26,512 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-16 22:11:26,514 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:26,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1960 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-16 22:11:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-16 22:11:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.5076923076923077) internal successors, (784), 520 states have internal predecessors, (784), 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-16 22:11:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 784 transitions. [2025-03-16 22:11:26,562 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 784 transitions. Word has length 94 [2025-03-16 22:11:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:26,563 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 784 transitions. [2025-03-16 22:11:26,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-16 22:11:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 784 transitions. [2025-03-16 22:11:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 22:11:26,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:26,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:11:26,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash 917251440, now seen corresponding path program 1 times [2025-03-16 22:11:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206219352] [2025-03-16 22:11:26,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:26,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 22:11:26,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 22:11:26,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:26,824 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-16 22:11:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206219352] [2025-03-16 22:11:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206219352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099797484] [2025-03-16 22:11:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:26,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:26,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:26,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:26,827 INFO L87 Difference]: Start difference. First operand 521 states and 784 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-16 22:11:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:27,066 INFO L93 Difference]: Finished difference Result 927 states and 1396 transitions. [2025-03-16 22:11:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:27,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-16 22:11:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:27,068 INFO L225 Difference]: With dead ends: 927 [2025-03-16 22:11:27,068 INFO L226 Difference]: Without dead ends: 523 [2025-03-16 22:11:27,069 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-16 22:11:27,070 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:27,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1957 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-16 22:11:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-16 22:11:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5057471264367817) internal successors, (786), 522 states have internal predecessors, (786), 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-16 22:11:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 786 transitions. [2025-03-16 22:11:27,092 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 786 transitions. Word has length 95 [2025-03-16 22:11:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:27,092 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 786 transitions. [2025-03-16 22:11:27,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-16 22:11:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 786 transitions. [2025-03-16 22:11:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 22:11:27,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:27,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:27,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:11:27,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:27,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 301533372, now seen corresponding path program 1 times [2025-03-16 22:11:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949595661] [2025-03-16 22:11:27,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:27,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 22:11:27,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 22:11:27,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:27,439 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-16 22:11:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:27,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949595661] [2025-03-16 22:11:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949595661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151750887] [2025-03-16 22:11:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:11:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:11:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:11:27,440 INFO L87 Difference]: Start difference. First operand 523 states and 786 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-16 22:11:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:27,727 INFO L93 Difference]: Finished difference Result 933 states and 1403 transitions. [2025-03-16 22:11:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-16 22:11:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:27,729 INFO L225 Difference]: With dead ends: 933 [2025-03-16 22:11:27,729 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 22:11:27,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:27,731 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 700 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:27,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1937 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 22:11:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2025-03-16 22:11:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.502857142857143) internal successors, (789), 525 states have internal predecessors, (789), 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-16 22:11:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 789 transitions. [2025-03-16 22:11:27,745 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 789 transitions. Word has length 96 [2025-03-16 22:11:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 789 transitions. [2025-03-16 22:11:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-16 22:11:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 789 transitions. [2025-03-16 22:11:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:11:27,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:27,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:11:27,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1649004267, now seen corresponding path program 1 times [2025-03-16 22:11:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705800162] [2025-03-16 22:11:27,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:27,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:11:27,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:11:27,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:27,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:27,991 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-16 22:11:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705800162] [2025-03-16 22:11:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705800162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:11:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448159356] [2025-03-16 22:11:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:27,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:27,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:27,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:27,994 INFO L87 Difference]: Start difference. First operand 526 states and 789 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-16 22:11:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:28,272 INFO L93 Difference]: Finished difference Result 945 states and 1418 transitions. [2025-03-16 22:11:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 22:11:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:28,275 INFO L225 Difference]: With dead ends: 945 [2025-03-16 22:11:28,275 INFO L226 Difference]: Without dead ends: 536 [2025-03-16 22:11:28,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:28,276 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 8 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:28,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2606 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-16 22:11:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-16 22:11:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.5009345794392523) internal successors, (803), 535 states have internal predecessors, (803), 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-16 22:11:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 803 transitions. [2025-03-16 22:11:28,284 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 803 transitions. Word has length 97 [2025-03-16 22:11:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:28,285 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 803 transitions. [2025-03-16 22:11:28,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-16 22:11:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 803 transitions. [2025-03-16 22:11:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:11:28,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:28,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:28,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:11:28,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:28,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1622186902, now seen corresponding path program 1 times [2025-03-16 22:11:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:28,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052065439] [2025-03-16 22:11:28,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:28,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:11:28,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:11:28,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:28,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:29,113 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-16 22:11:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052065439] [2025-03-16 22:11:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052065439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:11:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549801735] [2025-03-16 22:11:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:11:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:11:29,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:11:29,117 INFO L87 Difference]: Start difference. First operand 536 states and 803 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-16 22:11:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:29,548 INFO L93 Difference]: Finished difference Result 978 states and 1464 transitions. [2025-03-16 22:11:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:11:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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 97 [2025-03-16 22:11:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:29,551 INFO L225 Difference]: With dead ends: 978 [2025-03-16 22:11:29,552 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 22:11:29,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:11:29,553 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 24 mSDsluCounter, 3240 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:29,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3890 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:11:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 22:11:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 544. [2025-03-16 22:11:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4990791896869244) internal successors, (814), 543 states have internal predecessors, (814), 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-16 22:11:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 814 transitions. [2025-03-16 22:11:29,567 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 814 transitions. Word has length 97 [2025-03-16 22:11:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:29,567 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 814 transitions. [2025-03-16 22:11:29,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-16 22:11:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 814 transitions. [2025-03-16 22:11:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:29,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:29,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:29,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:11:29,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1443566391, now seen corresponding path program 1 times [2025-03-16 22:11:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411273555] [2025-03-16 22:11:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:29,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:29,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:29,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:29,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:29,879 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-16 22:11:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:29,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411273555] [2025-03-16 22:11:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411273555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132570082] [2025-03-16 22:11:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:29,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:29,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:29,881 INFO L87 Difference]: Start difference. First operand 544 states and 814 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:30,289 INFO L93 Difference]: Finished difference Result 1244 states and 1861 transitions. [2025-03-16 22:11:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:30,292 INFO L225 Difference]: With dead ends: 1244 [2025-03-16 22:11:30,292 INFO L226 Difference]: Without dead ends: 817 [2025-03-16 22:11:30,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:30,296 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1080 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:30,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2529 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:11:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-16 22:11:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 588. [2025-03-16 22:11:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.495741056218058) internal successors, (878), 587 states have internal predecessors, (878), 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-16 22:11:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 878 transitions. [2025-03-16 22:11:30,308 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 878 transitions. Word has length 98 [2025-03-16 22:11:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:30,308 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 878 transitions. [2025-03-16 22:11:30,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 878 transitions. [2025-03-16 22:11:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:30,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:30,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:11:30,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1368689357, now seen corresponding path program 1 times [2025-03-16 22:11:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:30,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245872946] [2025-03-16 22:11:30,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:30,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:30,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:30,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:30,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:30,653 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-16 22:11:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245872946] [2025-03-16 22:11:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245872946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116715869] [2025-03-16 22:11:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:30,654 INFO L87 Difference]: Start difference. First operand 588 states and 878 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:30,965 INFO L93 Difference]: Finished difference Result 1013 states and 1515 transitions. [2025-03-16 22:11:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:11:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:30,968 INFO L225 Difference]: With dead ends: 1013 [2025-03-16 22:11:30,968 INFO L226 Difference]: Without dead ends: 586 [2025-03-16 22:11:30,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:30,969 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 690 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:30,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 2562 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-16 22:11:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2025-03-16 22:11:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4965635738831615) internal successors, (871), 582 states have internal predecessors, (871), 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-16 22:11:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 871 transitions. [2025-03-16 22:11:30,983 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 871 transitions. Word has length 98 [2025-03-16 22:11:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 871 transitions. [2025-03-16 22:11:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 871 transitions. [2025-03-16 22:11:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:30,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:30,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:11:30,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 344913230, now seen corresponding path program 1 times [2025-03-16 22:11:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106223941] [2025-03-16 22:11:30,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:31,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:31,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:31,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:31,479 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-16 22:11:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106223941] [2025-03-16 22:11:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106223941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:11:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611177625] [2025-03-16 22:11:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:11:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:31,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:11:31,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:11:31,482 INFO L87 Difference]: Start difference. First operand 583 states and 871 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-16 22:11:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:31,851 INFO L93 Difference]: Finished difference Result 1023 states and 1529 transitions. [2025-03-16 22:11:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:11:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:31,854 INFO L225 Difference]: With dead ends: 1023 [2025-03-16 22:11:31,854 INFO L226 Difference]: Without dead ends: 601 [2025-03-16 22:11:31,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:11:31,855 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 21 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:31,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3236 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-16 22:11:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 589. [2025-03-16 22:11:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.4948979591836735) internal successors, (879), 588 states have internal predecessors, (879), 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-16 22:11:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 879 transitions. [2025-03-16 22:11:31,864 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 879 transitions. Word has length 98 [2025-03-16 22:11:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:31,864 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 879 transitions. [2025-03-16 22:11:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-16 22:11:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 879 transitions. [2025-03-16 22:11:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:31,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:31,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:11:31,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2109403524, now seen corresponding path program 1 times [2025-03-16 22:11:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263143207] [2025-03-16 22:11:31,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:31,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:31,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:31,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:32,146 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-16 22:11:32,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263143207] [2025-03-16 22:11:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263143207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:32,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:32,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556597407] [2025-03-16 22:11:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:32,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:32,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:32,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:32,148 INFO L87 Difference]: Start difference. First operand 589 states and 879 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:32,526 INFO L93 Difference]: Finished difference Result 1201 states and 1792 transitions. [2025-03-16 22:11:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:32,530 INFO L225 Difference]: With dead ends: 1201 [2025-03-16 22:11:32,530 INFO L226 Difference]: Without dead ends: 769 [2025-03-16 22:11:32,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:32,531 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1282 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:32,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2523 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-16 22:11:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 587. [2025-03-16 22:11:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4914675767918089) internal successors, (874), 586 states have internal predecessors, (874), 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-16 22:11:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 874 transitions. [2025-03-16 22:11:32,545 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 874 transitions. Word has length 98 [2025-03-16 22:11:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 874 transitions. [2025-03-16 22:11:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 874 transitions. [2025-03-16 22:11:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:32,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:32,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:32,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:11:32,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:32,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2014491519, now seen corresponding path program 1 times [2025-03-16 22:11:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:32,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82949209] [2025-03-16 22:11:32,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:32,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:32,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:32,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:32,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:32,778 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-16 22:11:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82949209] [2025-03-16 22:11:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82949209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:32,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450069849] [2025-03-16 22:11:32,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:32,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:32,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:32,779 INFO L87 Difference]: Start difference. First operand 587 states and 874 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:33,047 INFO L93 Difference]: Finished difference Result 1237 states and 1843 transitions. [2025-03-16 22:11:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:33,050 INFO L225 Difference]: With dead ends: 1237 [2025-03-16 22:11:33,050 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 22:11:33,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:33,051 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1054 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:33,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1941 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 22:11:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 585. [2025-03-16 22:11:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4880136986301369) internal successors, (869), 584 states have internal predecessors, (869), 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-16 22:11:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 869 transitions. [2025-03-16 22:11:33,061 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 869 transitions. Word has length 98 [2025-03-16 22:11:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:33,061 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 869 transitions. [2025-03-16 22:11:33,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 869 transitions. [2025-03-16 22:11:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 22:11:33,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:33,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:33,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:11:33,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 998367930, now seen corresponding path program 1 times [2025-03-16 22:11:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80605684] [2025-03-16 22:11:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:33,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 22:11:33,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 22:11:33,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:33,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:33,291 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-16 22:11:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80605684] [2025-03-16 22:11:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80605684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184051578] [2025-03-16 22:11:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:33,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:33,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:33,292 INFO L87 Difference]: Start difference. First operand 585 states and 869 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:33,524 INFO L93 Difference]: Finished difference Result 1013 states and 1509 transitions. [2025-03-16 22:11:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 22:11:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:33,527 INFO L225 Difference]: With dead ends: 1013 [2025-03-16 22:11:33,527 INFO L226 Difference]: Without dead ends: 577 [2025-03-16 22:11:33,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:33,528 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 747 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:33,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1939 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-16 22:11:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-03-16 22:11:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4913194444444444) internal successors, (859), 576 states have internal predecessors, (859), 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-16 22:11:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 859 transitions. [2025-03-16 22:11:33,537 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 859 transitions. Word has length 98 [2025-03-16 22:11:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:33,538 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 859 transitions. [2025-03-16 22:11:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-16 22:11:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 859 transitions. [2025-03-16 22:11:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 22:11:33,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:33,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:33,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:11:33,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -594003877, now seen corresponding path program 1 times [2025-03-16 22:11:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114162669] [2025-03-16 22:11:33,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:33,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 22:11:33,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 22:11:33,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:33,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:33,760 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-16 22:11:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:33,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114162669] [2025-03-16 22:11:33,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114162669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:33,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:33,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050209748] [2025-03-16 22:11:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:33,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:33,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:33,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:33,761 INFO L87 Difference]: Start difference. First operand 577 states and 859 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-16 22:11:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:34,135 INFO L93 Difference]: Finished difference Result 1177 states and 1756 transitions. [2025-03-16 22:11:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2025-03-16 22:11:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:34,138 INFO L225 Difference]: With dead ends: 1177 [2025-03-16 22:11:34,138 INFO L226 Difference]: Without dead ends: 749 [2025-03-16 22:11:34,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:34,139 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 988 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:34,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2523 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:11:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-16 22:11:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 585. [2025-03-16 22:11:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4863013698630136) internal successors, (868), 584 states have internal predecessors, (868), 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-16 22:11:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 868 transitions. [2025-03-16 22:11:34,150 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 868 transitions. Word has length 99 [2025-03-16 22:11:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:34,150 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 868 transitions. [2025-03-16 22:11:34,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-16 22:11:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 868 transitions. [2025-03-16 22:11:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 22:11:34,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:34,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:11:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:11:34,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash 344284069, now seen corresponding path program 1 times [2025-03-16 22:11:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:34,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590397893] [2025-03-16 22:11:34,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 22:11:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 22:11:34,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:34,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:11:34,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:11:34,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 22:11:34,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 22:11:34,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:11:34,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:11:34,279 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:11:34,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:11:34,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:11:34,285 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:34,342 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:11:34,366 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:11:34,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:11:34 BoogieIcfgContainer [2025-03-16 22:11:34,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:11:34,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:11:34,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:11:34,369 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:11:34,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:25" (3/4) ... [2025-03-16 22:11:34,371 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:11:34,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:11:34,372 INFO L158 Benchmark]: Toolchain (without parser) took 11632.58ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 130.4MB in the beginning and 314.5MB in the end (delta: -184.1MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-03-16 22:11:34,372 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:11:34,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.25ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 98.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 22:11:34,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.36ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 64.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 22:11:34,373 INFO L158 Benchmark]: Boogie Preprocessor took 187.54ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 46.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:11:34,374 INFO L158 Benchmark]: IcfgBuilder took 1769.51ms. Allocated memory is still 167.8MB. Free memory was 46.8MB in the beginning and 61.0MB in the end (delta: -14.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-03-16 22:11:34,374 INFO L158 Benchmark]: TraceAbstraction took 9149.65ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 61.0MB in the beginning and 314.6MB in the end (delta: -253.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:11:34,374 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 419.4MB. Free memory was 314.6MB in the beginning and 314.5MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:11:34,375 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.35ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.25ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 98.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.36ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 64.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 187.54ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 46.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1769.51ms. Allocated memory is still 167.8MB. Free memory was 46.8MB in the beginning and 61.0MB in the end (delta: -14.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9149.65ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 61.0MB in the beginning and 314.6MB in the end (delta: -253.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 419.4MB. Free memory was 314.6MB in the beginning and 314.5MB in the end (delta: 56.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 bitwiseAnd at line 212. 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 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_215 mask_SORT_215 = (SORT_215)-1 >> (sizeof(SORT_215) * 8 - 4); [L36] const SORT_215 msb_SORT_215 = (SORT_215)1 << (4 - 1); [L38] const SORT_217 mask_SORT_217 = (SORT_217)-1 >> (sizeof(SORT_217) * 8 - 60); [L39] const SORT_217 msb_SORT_217 = (SORT_217)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_3 var_204 = 1; [L46] const SORT_3 var_208 = 3735928559; [L47] const SORT_3 var_211 = 12245771; [L48] const SORT_215 var_216 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_1 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L58] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L58] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L59] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L60] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L61] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L62] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L63] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L64] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L65] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L66] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L67] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L68] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L69] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L70] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L71] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L72] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L73] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L74] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L75] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L76] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L77] SORT_1 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L78] SORT_1 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L79] SORT_1 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L80] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L81] SORT_1 state_83 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L82] SORT_1 state_85 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L83] SORT_1 state_220 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L84] SORT_1 state_251 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L85] SORT_1 state_264 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L86] SORT_1 state_269 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_10 init_13_arg_1 = var_11; [L89] state_12 = init_13_arg_1 [L90] SORT_1 init_16_arg_1 = var_14; [L91] state_15 = init_16_arg_1 [L92] SORT_10 init_19_arg_1 = var_11; [L93] state_18 = init_19_arg_1 [L94] SORT_1 init_21_arg_1 = var_14; [L95] state_20 = init_21_arg_1 [L96] SORT_3 init_26_arg_1 = var_24; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_14; [L99] state_27 = init_28_arg_1 [L100] SORT_3 init_31_arg_1 = var_24; [L101] state_30 = init_31_arg_1 [L102] SORT_1 init_33_arg_1 = var_14; [L103] state_32 = init_33_arg_1 [L104] SORT_3 init_38_arg_1 = var_24; [L105] state_37 = init_38_arg_1 [L106] SORT_1 init_40_arg_1 = var_14; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_43_arg_1 = var_24; [L109] state_42 = init_43_arg_1 [L110] SORT_1 init_45_arg_1 = var_14; [L111] state_44 = init_45_arg_1 [L112] SORT_1 init_62_arg_1 = var_14; [L113] state_61 = init_62_arg_1 [L114] SORT_1 init_64_arg_1 = var_14; [L115] state_63 = init_64_arg_1 [L116] SORT_1 init_66_arg_1 = var_14; [L117] state_65 = init_66_arg_1 [L118] SORT_1 init_68_arg_1 = var_14; [L119] state_67 = init_68_arg_1 [L120] SORT_1 init_70_arg_1 = var_14; [L121] state_69 = init_70_arg_1 [L122] SORT_1 init_72_arg_1 = var_14; [L123] state_71 = init_72_arg_1 [L124] SORT_1 init_74_arg_1 = var_14; [L125] state_73 = init_74_arg_1 [L126] SORT_1 init_76_arg_1 = var_14; [L127] state_75 = init_76_arg_1 [L128] SORT_1 init_78_arg_1 = var_14; [L129] state_77 = init_78_arg_1 [L130] SORT_1 init_80_arg_1 = var_14; [L131] state_79 = init_80_arg_1 [L132] SORT_1 init_82_arg_1 = var_14; [L133] state_81 = init_82_arg_1 [L134] SORT_1 init_84_arg_1 = var_14; [L135] state_83 = init_84_arg_1 [L136] SORT_1 init_86_arg_1 = var_14; [L137] state_85 = init_86_arg_1 [L138] SORT_1 init_221_arg_1 = var_14; [L139] state_220 = init_221_arg_1 [L140] SORT_1 init_252_arg_1 = var_14; [L141] state_251 = init_252_arg_1 [L142] SORT_1 init_265_arg_1 = var_14; [L143] state_264 = init_265_arg_1 [L144] SORT_1 init_270_arg_1 = var_14; [L145] state_269 = init_270_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L148] input_2 = __VERIFIER_nondet_uchar() [L149] input_4 = __VERIFIER_nondet_uint() [L150] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L150] input_4 = input_4 & mask_SORT_3 [L151] input_5 = __VERIFIER_nondet_uint() [L152] EXPR input_5 & mask_SORT_3 VAL [input_4=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L152] input_5 = input_5 & mask_SORT_3 [L153] input_6 = __VERIFIER_nondet_uchar() [L154] EXPR input_6 & mask_SORT_1 VAL [input_4=0, input_5=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L154] input_6 = input_6 & mask_SORT_1 [L155] input_7 = __VERIFIER_nondet_uchar() [L156] EXPR input_7 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L156] input_7 = input_7 & mask_SORT_1 [L157] input_8 = __VERIFIER_nondet_uchar() [L158] EXPR input_8 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L158] input_8 = input_8 & mask_SORT_1 [L159] input_9 = __VERIFIER_nondet_uchar() [L160] EXPR input_9 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L160] input_9 = input_9 & mask_SORT_1 [L163] SORT_1 var_17_arg_0 = state_15; [L164] SORT_10 var_17_arg_1 = state_12; [L165] SORT_10 var_17_arg_2 = var_11; [L166] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] EXPR var_17 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] var_17 = var_17 & mask_SORT_10 [L168] SORT_1 var_22_arg_0 = state_20; [L169] SORT_10 var_22_arg_1 = state_18; [L170] SORT_10 var_22_arg_2 = var_11; [L171] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_22=0, var_24=0, var_51=1] [L172] EXPR var_22 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L172] var_22 = var_22 & mask_SORT_10 [L173] SORT_10 var_23_arg_0 = var_17; [L174] SORT_10 var_23_arg_1 = var_22; [L175] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L176] SORT_1 var_29_arg_0 = state_27; [L177] SORT_3 var_29_arg_1 = state_25; [L178] SORT_3 var_29_arg_2 = var_24; [L179] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L180] EXPR var_29 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_51=1] [L180] var_29 = var_29 & mask_SORT_3 [L181] SORT_1 var_34_arg_0 = state_32; [L182] SORT_3 var_34_arg_1 = state_30; [L183] SORT_3 var_34_arg_2 = var_24; [L184] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1] [L185] EXPR var_34 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L185] var_34 = var_34 & mask_SORT_3 [L186] SORT_3 var_35_arg_0 = var_29; [L187] SORT_3 var_35_arg_1 = var_34; [L188] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L189] SORT_1 var_36_arg_0 = var_23; [L190] SORT_1 var_36_arg_1 = var_35; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1] [L191] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L191] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L192] SORT_1 var_41_arg_0 = state_39; [L193] SORT_3 var_41_arg_1 = state_37; [L194] SORT_3 var_41_arg_2 = var_24; [L195] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L196] EXPR var_41 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_51=1] [L196] var_41 = var_41 & mask_SORT_3 [L197] SORT_1 var_46_arg_0 = state_44; [L198] SORT_3 var_46_arg_1 = state_42; [L199] SORT_3 var_46_arg_2 = var_24; [L200] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1] [L201] EXPR var_46 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L201] var_46 = var_46 & mask_SORT_3 [L202] SORT_3 var_47_arg_0 = var_41; [L203] SORT_3 var_47_arg_1 = var_46; [L204] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L205] SORT_1 var_48_arg_0 = var_36; [L206] SORT_1 var_48_arg_1 = var_47; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1] [L207] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L207] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L208] SORT_1 var_52_arg_0 = var_48; [L209] SORT_1 var_52 = ~var_52_arg_0; [L210] SORT_1 var_53_arg_0 = var_51; [L211] SORT_1 var_53_arg_1 = var_52; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2] [L212] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L212] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L213] EXPR var_53 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L213] var_53 = var_53 & mask_SORT_1 [L214] SORT_1 bad_54_arg_0 = var_53; [L215] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 521 locations, 785 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6594 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6594 mSDsluCounter, 29603 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21809 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6370 IncrementalHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 7794 mSDtfsCounter, 6370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 824 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1154 ConstructedInterpolants, 0 QuantifiedInterpolants, 2865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-16 22:11:34,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.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 a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:11:36,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:11:36,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:11:36,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:11:36,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:11:36,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:11:36,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:11:36,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:11:36,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:11:36,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:11:36,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:11:36,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:11:36,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:11:36,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:11:36,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:11:36,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:11:36,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:11:36,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:36,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:11:36,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:11:36,342 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 -> a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab [2025-03-16 22:11:36,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:11:36,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:11:36,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:11:36,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:11:36,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:11:36,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-16 22:11:37,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d65581d/389ce8a8964f46619851c3bbae6e2cee/FLAG12e359241 [2025-03-16 22:11:38,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:11:38,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-16 22:11:38,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d65581d/389ce8a8964f46619851c3bbae6e2cee/FLAG12e359241 [2025-03-16 22:11:38,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d65581d/389ce8a8964f46619851c3bbae6e2cee [2025-03-16 22:11:38,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:11:38,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:11:38,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:38,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:11:38,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:11:38,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1aceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38, skipping insertion in model container [2025-03-16 22:11:38,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:11:38,196 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.mul9.c[1244,1257] [2025-03-16 22:11:38,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:38,314 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:11:38,323 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.mul9.c[1244,1257] [2025-03-16 22:11:38,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:38,392 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:11:38,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38 WrapperNode [2025-03-16 22:11:38,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:38,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:38,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:11:38,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:11:38,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,458 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 735 [2025-03-16 22:11:38,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:38,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:11:38,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:11:38,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:11:38,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,497 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 22:11:38,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:11:38,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:11:38,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:11:38,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:11:38,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (1/1) ... [2025-03-16 22:11:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:38,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:38,567 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-16 22:11:38,571 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-16 22:11:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:11:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:11:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 22:11:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:11:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:11:38,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:11:38,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:11:39,454 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-16 22:11:39,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:11:39,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:11:39,462 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:11:39,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:39 BoogieIcfgContainer [2025-03-16 22:11:39,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:11:39,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:11:39,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:11:39,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:11:39,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:11:38" (1/3) ... [2025-03-16 22:11:39,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580d270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:39, skipping insertion in model container [2025-03-16 22:11:39,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:38" (2/3) ... [2025-03-16 22:11:39,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580d270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:39, skipping insertion in model container [2025-03-16 22:11:39,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:39" (3/3) ... [2025-03-16 22:11:39,469 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul9.c [2025-03-16 22:11:39,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:11:39,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul9.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:11:39,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:11:39,523 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;@3b5f1a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:11:39,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:11:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-16 22:11:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:11:39,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:39,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:11:39,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:39,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:11:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:11:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913125925] [2025-03-16 22:11:39,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:39,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:11:39,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:39,548 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-16 22:11:39,550 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-16 22:11:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:11:39,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:11:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 22:11:39,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:11:40,125 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-16 22:11:40,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:11:40,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:11:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913125925] [2025-03-16 22:11:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913125925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:40,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:40,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:11:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60347816] [2025-03-16 22:11:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:40,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:11:40,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:40,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:40,148 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 22:11:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:40,388 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-16 22:11:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 22:11:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:40,395 INFO L225 Difference]: With dead ends: 15 [2025-03-16 22:11:40,395 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 22:11:40,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 22:11:40,400 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 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.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:40,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 22:11:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 22:11:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 22:11:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:11:40,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:11:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:40,424 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:11:40,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 22:11:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:11:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:11:40,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:40,424 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:11:40,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:11:40,624 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-16 22:11:40,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:11:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:11:40,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606842272] [2025-03-16 22:11:40,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:40,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:11:40,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:40,629 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-16 22:11:40,631 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-16 22:11:40,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:11:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:11:40,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-16 22:11:40,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:11:42,142 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-16 22:11:42,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:11:56,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse16 (= |c_ULTIMATE.start_main_~state_269~0#1| (_ bv0 8))) (.cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_42~0#1|))) (let ((.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (not (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))))) (.cse13 (not .cse16)) (.cse36 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (.cse12 (= |c_ULTIMATE.start_main_~state_251~0#1| (_ bv0 8))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse37 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (let ((.cse20 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse14 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (.cse27 (or .cse25 .cse37)) (.cse8 (not .cse12)) (.cse26 (or .cse16 .cse36 .cse25)) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse11 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse13)) (.cse32 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse25)) (.cse33 (or .cse35 .cse25))) (let ((.cse10 (and .cse32 .cse33)) (.cse28 (and (or .cse12 (and (or .cse16 (and .cse34 .cse25)) (or .cse13 (and (or .cse14 .cse34) .cse27)))) (or .cse8 (and .cse26 (or .cse34 .cse11))))) (.cse24 (not .cse20))) (let ((.cse29 (or .cse28 .cse24)) (.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse15 (or .cse37 .cse10)) (.cse9 (or .cse16 .cse36 .cse10))) (let ((.cse18 (let ((.cse31 (or .cse34 .cse35))) (let ((.cse30 (and .cse31 .cse32))) (and (or .cse12 (and (or .cse13 (and .cse15 (or .cse14 .cse30))) (or .cse16 (and .cse31 .cse32 .cse33)))) (or .cse8 (and .cse9 (or .cse30 .cse11))))))) (.cse5 (not .cse6)) (.cse23 (and .cse29 (or .cse20 .cse28))) (.cse17 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))) (.cse19 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))))) (let ((.cse0 (and (or .cse20 (and (or .cse17 (and (or (and (or .cse25 .cse11) .cse26) .cse8) (or .cse12 (and (or .cse13 (and (or .cse14 .cse25) .cse27)) (or .cse16 .cse25))))) (or .cse28 .cse19))) .cse29)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse22 (or .cse5 .cse23)) (.cse7 (or .cse18 .cse24))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2))) .cse3))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 .cse4))))))))))) (or (and (or .cse5 .cse0) (or .cse6 (and .cse7 (or (and (or (and (or .cse8 (and .cse9 (or .cse10 .cse11))) (or .cse12 (and (or .cse13 (and (or .cse14 .cse10) .cse15)) (or .cse16 .cse10)))) .cse17) (or .cse18 .cse19)) .cse20)))) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse21))) .cse3)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse21 .cse4))))))))))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3)))) (and .cse22 (or .cse6 .cse23))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3))))) (and .cse22 (or .cse6 (and .cse7 (or .cse18 .cse20))))))))))))) is different from false [2025-03-16 22:12:28,520 WARN L286 SmtUtils]: Spent 15.19s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)