./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:31:38,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:31:38,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:31:38,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:31:38,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:31:38,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:31:38,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:31:38,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:31:38,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:31:38,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:31:38,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:31:38,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:31:38,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:31:38,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:31:38,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:31:38,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:31:38,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:31:38,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:31:38,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:31:38,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:31:38,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:31:38,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:31:38,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:31:38,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:31:38,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:31:38,782 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2025-03-03 18:31:39,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:31:39,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:31:39,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:31:39,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:31:39,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:31:39,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:31:40,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3388f1c/497208caf3cb42fcb46004e26343db5a/FLAG16ab13385 [2025-03-03 18:31:40,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:31:40,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:31:40,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3388f1c/497208caf3cb42fcb46004e26343db5a/FLAG16ab13385 [2025-03-03 18:31:40,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3388f1c/497208caf3cb42fcb46004e26343db5a [2025-03-03 18:31:40,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:31:40,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:31:40,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:31:40,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:31:40,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:31:40,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:31:40" (1/1) ... [2025-03-03 18:31:40,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abc21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:40, skipping insertion in model container [2025-03-03 18:31:40,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:31:40" (1/1) ... [2025-03-03 18:31:40,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:31:40,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-03 18:31:41,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:31:41,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:31:41,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-03 18:31:41,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:31:41,230 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:31:41,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41 WrapperNode [2025-03-03 18:31:41,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:31:41,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:31:41,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:31:41,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:31:41,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,677 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4514 [2025-03-03 18:31:41,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:31:41,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:31:41,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:31:41,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:31:41,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:31:41,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:41,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:42,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:42,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:31:42,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:31:42,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:31:42,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:31:42,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (1/1) ... [2025-03-03 18:31:42,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:31:42,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:31:42,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:31:42,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:31:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:31:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:31:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:31:42,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:31:42,378 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:31:42,379 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:31:45,765 INFO L? ?]: Removed 2689 outVars from TransFormulas that were not future-live. [2025-03-03 18:31:45,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:31:45,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:31:45,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:31:45,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:31:45 BoogieIcfgContainer [2025-03-03 18:31:45,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:31:45,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:31:45,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:31:45,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:31:45,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:31:40" (1/3) ... [2025-03-03 18:31:45,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abd118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:31:45, skipping insertion in model container [2025-03-03 18:31:45,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:41" (2/3) ... [2025-03-03 18:31:45,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abd118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:31:45, skipping insertion in model container [2025-03-03 18:31:45,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:31:45" (3/3) ... [2025-03-03 18:31:45,946 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:31:45,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:31:45,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c that has 1 procedures, 1351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:31:46,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:31:46,043 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;@6e0ce89a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:31:46,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:31:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 1351 states, 1349 states have (on average 1.4996293550778355) internal successors, (2023), 1350 states have internal predecessors, (2023), 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-03 18:31:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 18:31:46,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:46,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:46,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1960401444, now seen corresponding path program 1 times [2025-03-03 18:31:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:46,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815156839] [2025-03-03 18:31:46,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:46,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 18:31:46,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 18:31:46,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:46,698 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-03 18:31:46,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:46,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815156839] [2025-03-03 18:31:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815156839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:46,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:46,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:31:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985449957] [2025-03-03 18:31:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:31:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:46,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:31:46,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:46,724 INFO L87 Difference]: Start difference. First operand has 1351 states, 1349 states have (on average 1.4996293550778355) internal successors, (2023), 1350 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:47,383 INFO L93 Difference]: Finished difference Result 2647 states and 3967 transitions. [2025-03-03 18:31:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:31:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-03 18:31:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:47,403 INFO L225 Difference]: With dead ends: 2647 [2025-03-03 18:31:47,403 INFO L226 Difference]: Without dead ends: 1350 [2025-03-03 18:31:47,411 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-03 18:31:47,413 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 0 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:47,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5041 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-03 18:31:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2025-03-03 18:31:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.498146775389177) internal successors, (2021), 1349 states have internal predecessors, (2021), 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-03 18:31:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2021 transitions. [2025-03-03 18:31:47,498 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2021 transitions. Word has length 47 [2025-03-03 18:31:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:47,499 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2021 transitions. [2025-03-03 18:31:47,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03 18:31:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2021 transitions. [2025-03-03 18:31:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 18:31:47,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:47,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:47,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:31:47,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:47,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -638221275, now seen corresponding path program 1 times [2025-03-03 18:31:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624444471] [2025-03-03 18:31:47,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:47,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 18:31:47,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 18:31:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:47,710 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-03 18:31:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624444471] [2025-03-03 18:31:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624444471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:31:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440849043] [2025-03-03 18:31:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:47,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:31:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:47,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:31:47,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:47,713 INFO L87 Difference]: Start difference. First operand 1350 states and 2021 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:48,235 INFO L93 Difference]: Finished difference Result 2648 states and 3965 transitions. [2025-03-03 18:31:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:31:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 18:31:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:48,293 INFO L225 Difference]: With dead ends: 2648 [2025-03-03 18:31:48,293 INFO L226 Difference]: Without dead ends: 1352 [2025-03-03 18:31:48,294 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-03 18:31:48,294 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 0 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:48,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5038 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:31:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-03 18:31:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2025-03-03 18:31:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1351 states have (on average 1.4974093264248705) internal successors, (2023), 1351 states have internal predecessors, (2023), 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-03 18:31:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2023 transitions. [2025-03-03 18:31:48,314 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2023 transitions. Word has length 48 [2025-03-03 18:31:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:48,314 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2023 transitions. [2025-03-03 18:31:48,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2023 transitions. [2025-03-03 18:31:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 18:31:48,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:48,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:31:48,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -673478921, now seen corresponding path program 1 times [2025-03-03 18:31:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181979988] [2025-03-03 18:31:48,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:48,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 18:31:48,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 18:31:48,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:48,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:48,606 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-03 18:31:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181979988] [2025-03-03 18:31:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181979988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773120324] [2025-03-03 18:31:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:48,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:48,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:48,608 INFO L87 Difference]: Start difference. First operand 1352 states and 2023 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:49,254 INFO L93 Difference]: Finished difference Result 2884 states and 4313 transitions. [2025-03-03 18:31:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-03 18:31:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:49,261 INFO L225 Difference]: With dead ends: 2884 [2025-03-03 18:31:49,261 INFO L226 Difference]: Without dead ends: 1586 [2025-03-03 18:31:49,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:49,264 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 2673 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:49,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 5015 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2025-03-03 18:31:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1362. [2025-03-03 18:31:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.49669360764144) internal successors, (2037), 1361 states have internal predecessors, (2037), 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-03 18:31:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2037 transitions. [2025-03-03 18:31:49,287 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2037 transitions. Word has length 49 [2025-03-03 18:31:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:49,288 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2037 transitions. [2025-03-03 18:31:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2037 transitions. [2025-03-03 18:31:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 18:31:49,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:49,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:31:49,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 653911929, now seen corresponding path program 1 times [2025-03-03 18:31:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496763359] [2025-03-03 18:31:49,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:49,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 18:31:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 18:31:49,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:49,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:49,514 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-03 18:31:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496763359] [2025-03-03 18:31:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496763359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932491386] [2025-03-03 18:31:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:49,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:49,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:49,515 INFO L87 Difference]: Start difference. First operand 1362 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:50,310 INFO L93 Difference]: Finished difference Result 2678 states and 4006 transitions. [2025-03-03 18:31:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 18:31:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:50,315 INFO L225 Difference]: With dead ends: 2678 [2025-03-03 18:31:50,315 INFO L226 Difference]: Without dead ends: 1380 [2025-03-03 18:31:50,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:50,318 INFO L435 NwaCegarLoop]: 1680 mSDtfsCounter, 12 mSDsluCounter, 6707 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8387 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:50,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8387 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-03 18:31:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-03-03 18:31:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.4949127906976745) internal successors, (2057), 1376 states have internal predecessors, (2057), 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-03 18:31:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2057 transitions. [2025-03-03 18:31:50,340 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2057 transitions. Word has length 50 [2025-03-03 18:31:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2057 transitions. [2025-03-03 18:31:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2057 transitions. [2025-03-03 18:31:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 18:31:50,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:50,342 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] [2025-03-03 18:31:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:31:50,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1359842994, now seen corresponding path program 1 times [2025-03-03 18:31:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340742672] [2025-03-03 18:31:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 18:31:50,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 18:31:50,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:50,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:50,608 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-03 18:31:50,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340742672] [2025-03-03 18:31:50,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340742672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:50,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:50,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313298965] [2025-03-03 18:31:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:50,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:50,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:50,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:50,609 INFO L87 Difference]: Start difference. First operand 1377 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03 18:31:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:51,218 INFO L93 Difference]: Finished difference Result 2921 states and 4363 transitions. [2025-03-03 18:31:51,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:51,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2025-03-03 18:31:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:51,223 INFO L225 Difference]: With dead ends: 2921 [2025-03-03 18:31:51,223 INFO L226 Difference]: Without dead ends: 1610 [2025-03-03 18:31:51,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:51,225 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2662 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 5016 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:51,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 5016 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-03-03 18:31:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1387. [2025-03-03 18:31:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1386 states have (on average 1.4927849927849928) internal successors, (2069), 1386 states have internal predecessors, (2069), 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-03 18:31:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2069 transitions. [2025-03-03 18:31:51,243 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2069 transitions. Word has length 51 [2025-03-03 18:31:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 2069 transitions. [2025-03-03 18:31:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03 18:31:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2069 transitions. [2025-03-03 18:31:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 18:31:51,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:51,244 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] [2025-03-03 18:31:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:31:51,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 93725881, now seen corresponding path program 1 times [2025-03-03 18:31:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277981756] [2025-03-03 18:31:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 18:31:51,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 18:31:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:51,515 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-03 18:31:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277981756] [2025-03-03 18:31:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277981756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:51,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:51,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:31:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994886244] [2025-03-03 18:31:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:51,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:31:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:51,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:31:51,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:31:51,516 INFO L87 Difference]: Start difference. First operand 1387 states and 2069 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-03 18:31:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:52,354 INFO L93 Difference]: Finished difference Result 2720 states and 4059 transitions. [2025-03-03 18:31:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:31:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-03-03 18:31:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:52,358 INFO L225 Difference]: With dead ends: 2720 [2025-03-03 18:31:52,358 INFO L226 Difference]: Without dead ends: 1409 [2025-03-03 18:31:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:31:52,364 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 6 mSDsluCounter, 8370 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10047 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:52,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10047 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-03 18:31:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1398. [2025-03-03 18:31:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.4917680744452397) internal successors, (2084), 1397 states have internal predecessors, (2084), 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-03 18:31:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2084 transitions. [2025-03-03 18:31:52,389 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2084 transitions. Word has length 52 [2025-03-03 18:31:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:52,389 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2084 transitions. [2025-03-03 18:31:52,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-03 18:31:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2084 transitions. [2025-03-03 18:31:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 18:31:52,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:52,391 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] [2025-03-03 18:31:52,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:31:52,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:52,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2105308428, now seen corresponding path program 1 times [2025-03-03 18:31:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641984942] [2025-03-03 18:31:52,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 18:31:52,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 18:31:52,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:52,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:52,735 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-03 18:31:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641984942] [2025-03-03 18:31:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641984942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:31:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114193426] [2025-03-03 18:31:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:31:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:31:52,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:52,738 INFO L87 Difference]: Start difference. First operand 1398 states and 2084 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-03 18:31:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:53,446 INFO L93 Difference]: Finished difference Result 2730 states and 4074 transitions. [2025-03-03 18:31:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:31:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2025-03-03 18:31:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:53,450 INFO L225 Difference]: With dead ends: 2730 [2025-03-03 18:31:53,450 INFO L226 Difference]: Without dead ends: 1411 [2025-03-03 18:31:53,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:53,452 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 11 mSDsluCounter, 8372 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10049 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:53,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10049 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-03 18:31:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1410. [2025-03-03 18:31:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.489709013484741) internal successors, (2099), 1409 states have internal predecessors, (2099), 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-03 18:31:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2099 transitions. [2025-03-03 18:31:53,467 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2099 transitions. Word has length 52 [2025-03-03 18:31:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2099 transitions. [2025-03-03 18:31:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-03 18:31:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2099 transitions. [2025-03-03 18:31:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:31:53,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:53,468 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] [2025-03-03 18:31:53,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:31:53,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:53,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1984579565, now seen corresponding path program 1 times [2025-03-03 18:31:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:53,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395921738] [2025-03-03 18:31:53,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:31:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:31:53,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:53,683 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-03 18:31:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395921738] [2025-03-03 18:31:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395921738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079293504] [2025-03-03 18:31:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:53,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:53,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:53,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:53,686 INFO L87 Difference]: Start difference. First operand 1410 states and 2099 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 18:31:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:54,218 INFO L93 Difference]: Finished difference Result 2754 states and 4104 transitions. [2025-03-03 18:31:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-03-03 18:31:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:54,221 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 18:31:54,221 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 18:31:54,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03 18:31:54,223 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1991 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 5030 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:54,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 5030 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:31:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 18:31:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2025-03-03 18:31:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.4883227176220806) internal successors, (2103), 1413 states have internal predecessors, (2103), 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-03 18:31:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2103 transitions. [2025-03-03 18:31:54,240 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2103 transitions. Word has length 53 [2025-03-03 18:31:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:54,240 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2103 transitions. [2025-03-03 18:31:54,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 18:31:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2103 transitions. [2025-03-03 18:31:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:31:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:54,241 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] [2025-03-03 18:31:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:31:54,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:54,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -623465005, now seen corresponding path program 1 times [2025-03-03 18:31:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570552560] [2025-03-03 18:31:54,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:54,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:31:54,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:31:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:54,657 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-03 18:31:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570552560] [2025-03-03 18:31:54,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570552560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:31:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224515233] [2025-03-03 18:31:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:54,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:31:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:54,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:31:54,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:31:54,659 INFO L87 Difference]: Start difference. First operand 1414 states and 2103 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-03 18:31:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:55,840 INFO L93 Difference]: Finished difference Result 2751 states and 4099 transitions. [2025-03-03 18:31:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:31:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 54 [2025-03-03 18:31:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:55,844 INFO L225 Difference]: With dead ends: 2751 [2025-03-03 18:31:55,844 INFO L226 Difference]: Without dead ends: 1421 [2025-03-03 18:31:55,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:31:55,846 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2012 mSDsluCounter, 11692 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 13365 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 13365 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:31:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-03-03 18:31:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1418. [2025-03-03 18:31:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.487649964714185) internal successors, (2108), 1417 states have internal predecessors, (2108), 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-03 18:31:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2108 transitions. [2025-03-03 18:31:55,863 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2108 transitions. Word has length 54 [2025-03-03 18:31:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:55,863 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2108 transitions. [2025-03-03 18:31:55,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-03 18:31:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2108 transitions. [2025-03-03 18:31:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:31:55,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:55,863 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] [2025-03-03 18:31:55,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:31:55,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1274783609, now seen corresponding path program 1 times [2025-03-03 18:31:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714837831] [2025-03-03 18:31:55,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:55,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:31:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:31:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:56,027 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-03 18:31:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714837831] [2025-03-03 18:31:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714837831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308713821] [2025-03-03 18:31:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:56,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:56,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:56,028 INFO L87 Difference]: Start difference. First operand 1418 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03 18:31:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:56,725 INFO L93 Difference]: Finished difference Result 2999 states and 4458 transitions. [2025-03-03 18:31:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2025-03-03 18:31:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:56,730 INFO L225 Difference]: With dead ends: 2999 [2025-03-03 18:31:56,730 INFO L226 Difference]: Without dead ends: 1639 [2025-03-03 18:31:56,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:56,731 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 2687 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:56,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 4909 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-03-03 18:31:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1402. [2025-03-03 18:31:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.489650249821556) internal successors, (2087), 1401 states have internal predecessors, (2087), 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-03 18:31:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2087 transitions. [2025-03-03 18:31:56,745 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2087 transitions. Word has length 54 [2025-03-03 18:31:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:56,745 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2087 transitions. [2025-03-03 18:31:56,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03 18:31:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2087 transitions. [2025-03-03 18:31:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:31:56,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:56,745 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] [2025-03-03 18:31:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:31:56,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1885364032, now seen corresponding path program 1 times [2025-03-03 18:31:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500920268] [2025-03-03 18:31:56,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:56,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:31:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:31:56,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:57,010 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-03 18:31:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500920268] [2025-03-03 18:31:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500920268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998042213] [2025-03-03 18:31:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:57,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:57,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:57,012 INFO L87 Difference]: Start difference. First operand 1402 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 18:31:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:57,576 INFO L93 Difference]: Finished difference Result 2883 states and 4292 transitions. [2025-03-03 18:31:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:57,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-03-03 18:31:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:57,580 INFO L225 Difference]: With dead ends: 2883 [2025-03-03 18:31:57,580 INFO L226 Difference]: Without dead ends: 1546 [2025-03-03 18:31:57,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:57,582 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 2203 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 5004 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:57,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 5004 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:31:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-03 18:31:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1399. [2025-03-03 18:31:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4899856938483549) internal successors, (2083), 1398 states have internal predecessors, (2083), 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-03 18:31:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2083 transitions. [2025-03-03 18:31:57,596 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2083 transitions. Word has length 55 [2025-03-03 18:31:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2083 transitions. [2025-03-03 18:31:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 18:31:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2083 transitions. [2025-03-03 18:31:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:31:57,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:57,597 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] [2025-03-03 18:31:57,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:31:57,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:57,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1715183758, now seen corresponding path program 1 times [2025-03-03 18:31:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:57,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603847255] [2025-03-03 18:31:57,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:57,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:31:57,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:31:57,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:57,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:58,220 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-03 18:31:58,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:58,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603847255] [2025-03-03 18:31:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603847255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:31:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901779206] [2025-03-03 18:31:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:31:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:58,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:31:58,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:31:58,221 INFO L87 Difference]: Start difference. First operand 1399 states and 2083 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-03 18:31:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:59,662 INFO L93 Difference]: Finished difference Result 2958 states and 4405 transitions. [2025-03-03 18:31:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:31:59,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 56 [2025-03-03 18:31:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:59,666 INFO L225 Difference]: With dead ends: 2958 [2025-03-03 18:31:59,666 INFO L226 Difference]: Without dead ends: 1624 [2025-03-03 18:31:59,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:31:59,667 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 2648 mSDsluCounter, 13558 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 15223 SdHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:59,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 15223 Invalid, 3284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:31:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2025-03-03 18:31:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1404. [2025-03-03 18:31:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.489665003563792) internal successors, (2090), 1403 states have internal predecessors, (2090), 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-03 18:31:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2090 transitions. [2025-03-03 18:31:59,681 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2090 transitions. Word has length 56 [2025-03-03 18:31:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2090 transitions. [2025-03-03 18:31:59,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-03 18:31:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2090 transitions. [2025-03-03 18:31:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:31:59,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:59,682 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] [2025-03-03 18:31:59,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:31:59,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 777013444, now seen corresponding path program 1 times [2025-03-03 18:31:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849115420] [2025-03-03 18:31:59,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:59,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:31:59,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:31:59,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:59,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:31:59,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:31:59,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:31:59,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:31:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:59,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:31:59,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:31:59,804 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:31:59,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:31:59,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:31:59,809 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:59,841 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:31:59,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:31:59,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:31:59 BoogieIcfgContainer [2025-03-03 18:31:59,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:31:59,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:31:59,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:31:59,859 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:31:59,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:31:45" (3/4) ... [2025-03-03 18:31:59,861 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:31:59,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:31:59,862 INFO L158 Benchmark]: Toolchain (without parser) took 19175.49ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 109.2MB in the beginning and 341.4MB in the end (delta: -232.1MB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,862 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:31:59,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.05ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 86.7MB in the end (delta: 22.0MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 445.99ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.7MB in the beginning and 246.0MB in the end (delta: -159.3MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,862 INFO L158 Benchmark]: Boogie Preprocessor took 380.29ms. Allocated memory is still 369.1MB. Free memory was 246.0MB in the beginning and 220.0MB in the end (delta: 26.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,863 INFO L158 Benchmark]: IcfgBuilder took 3878.07ms. Allocated memory was 369.1MB in the beginning and 662.7MB in the end (delta: 293.6MB). Free memory was 220.0MB in the beginning and 418.2MB in the end (delta: -198.2MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,863 INFO L158 Benchmark]: TraceAbstraction took 13918.35ms. Allocated memory was 662.7MB in the beginning and 721.4MB in the end (delta: 58.7MB). Free memory was 418.2MB in the beginning and 341.4MB in the end (delta: 76.8MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2025-03-03 18:31:59,863 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 721.4MB. Free memory was 341.4MB in the beginning and 341.4MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:31:59,864 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.90ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.05ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 86.7MB in the end (delta: 22.0MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 445.99ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 86.7MB in the beginning and 246.0MB in the end (delta: -159.3MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 380.29ms. Allocated memory is still 369.1MB. Free memory was 246.0MB in the beginning and 220.0MB in the end (delta: 26.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * IcfgBuilder took 3878.07ms. Allocated memory was 369.1MB in the beginning and 662.7MB in the end (delta: 293.6MB). Free memory was 220.0MB in the beginning and 418.2MB in the end (delta: -198.2MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13918.35ms. Allocated memory was 662.7MB in the beginning and 721.4MB in the end (delta: 58.7MB). Free memory was 418.2MB in the beginning and 341.4MB in the end (delta: 76.8MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 721.4MB. Free memory was 341.4MB in the beginning and 341.4MB in the end (delta: 39.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 bitwiseOr at line 201, overapproximation of bitwiseOr at line 215, overapproximation of bitwiseAnd at line 212, overapproximation of bitwiseAnd at line 220. 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 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 12); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (12 - 1); [L38] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 17); [L39] const SORT_98 msb_SORT_98 = (SORT_98)1 << (17 - 1); [L41] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 5); [L42] const SORT_99 msb_SORT_99 = (SORT_99)1 << (5 - 1); [L44] const SORT_102 mask_SORT_102 = (SORT_102)-1 >> (sizeof(SORT_102) * 8 - 9); [L45] const SORT_102 msb_SORT_102 = (SORT_102)1 << (9 - 1); [L47] const SORT_104 mask_SORT_104 = (SORT_104)-1 >> (sizeof(SORT_104) * 8 - 10); [L48] const SORT_104 msb_SORT_104 = (SORT_104)1 << (10 - 1); [L50] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 11); [L51] const SORT_107 msb_SORT_107 = (SORT_107)1 << (11 - 1); [L53] const SORT_112 mask_SORT_112 = (SORT_112)-1 >> (sizeof(SORT_112) * 8 - 13); [L54] const SORT_112 msb_SORT_112 = (SORT_112)1 << (13 - 1); [L56] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 14); [L57] const SORT_115 msb_SORT_115 = (SORT_115)1 << (14 - 1); [L59] const SORT_118 mask_SORT_118 = (SORT_118)-1 >> (sizeof(SORT_118) * 8 - 15); [L60] const SORT_118 msb_SORT_118 = (SORT_118)1 << (15 - 1); [L62] const SORT_151 mask_SORT_151 = (SORT_151)-1 >> (sizeof(SORT_151) * 8 - 7); [L63] const SORT_151 msb_SORT_151 = (SORT_151)1 << (7 - 1); [L65] const SORT_211 mask_SORT_211 = (SORT_211)-1 >> (sizeof(SORT_211) * 8 - 2); [L66] const SORT_211 msb_SORT_211 = (SORT_211)1 << (2 - 1); [L68] const SORT_370 mask_SORT_370 = (SORT_370)-1 >> (sizeof(SORT_370) * 8 - 4); [L69] const SORT_370 msb_SORT_370 = (SORT_370)1 << (4 - 1); [L71] const SORT_373 mask_SORT_373 = (SORT_373)-1 >> (sizeof(SORT_373) * 8 - 6); [L72] const SORT_373 msb_SORT_373 = (SORT_373)1 << (6 - 1); [L74] const SORT_376 mask_SORT_376 = (SORT_376)-1 >> (sizeof(SORT_376) * 8 - 8); [L75] const SORT_376 msb_SORT_376 = (SORT_376)1 << (8 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_9 var_11 = 2; [L79] const SORT_9 var_13 = 0; [L80] const SORT_1 var_19 = 0; [L81] const SORT_1 var_34 = 1; [L82] const SORT_44 var_45 = 0; [L83] const SORT_9 var_61 = 1; [L84] const SORT_9 var_66 = 4; [L85] const SORT_9 var_68 = 5; [L86] const SORT_9 var_72 = 3; [L87] const SORT_99 var_100 = 0; [L88] const SORT_151 var_153 = 5; [L89] const SORT_151 var_157 = 4; [L90] const SORT_151 var_161 = 3; [L91] const SORT_151 var_165 = 2; [L92] const SORT_151 var_169 = 1; [L93] const SORT_151 var_173 = 0; [L94] const SORT_44 var_196 = 2; [L95] const SORT_211 var_213 = 0; [L96] const SORT_3 var_220 = 65535; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_208; [L102] SORT_3 input_209; [L103] SORT_3 input_210; [L104] SORT_3 input_219; [L105] SORT_3 input_228; [L106] SORT_3 input_229; [L107] SORT_3 input_230; [L108] SORT_3 input_233; [L109] SORT_3 input_251; [L110] SORT_3 input_252; [L111] SORT_3 input_253; [L112] SORT_3 input_256; [L113] SORT_3 input_258; [L114] SORT_211 input_272; [L115] SORT_211 input_273; [L116] SORT_211 input_274; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L119] SORT_9 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L120] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L121] SORT_3 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L122] SORT_3 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L123] SORT_3 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L124] SORT_3 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L125] SORT_44 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L126] SORT_44 state_48 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L127] SORT_3 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L128] SORT_3 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L129] SORT_3 state_54 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L130] SORT_3 state_56 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_9 init_15_arg_1 = var_13; [L135] state_14 = init_15_arg_1 [L136] SORT_1 init_21_arg_1 = var_19; [L137] state_20 = init_21_arg_1 [L138] SORT_3 init_24_arg_1 = var_6; [L139] state_23 = init_24_arg_1 [L140] SORT_3 init_39_arg_1 = var_6; [L141] state_38 = init_39_arg_1 [L142] SORT_3 init_41_arg_1 = var_6; [L143] state_40 = init_41_arg_1 [L144] SORT_3 init_43_arg_1 = var_6; [L145] state_42 = init_43_arg_1 [L146] SORT_44 init_47_arg_1 = var_45; [L147] state_46 = init_47_arg_1 [L148] SORT_44 init_49_arg_1 = var_45; [L149] state_48 = init_49_arg_1 [L150] SORT_3 init_51_arg_1 = var_6; [L151] state_50 = init_51_arg_1 [L152] SORT_3 init_53_arg_1 = var_6; [L153] state_52 = init_53_arg_1 [L154] SORT_3 init_55_arg_1 = var_6; [L155] state_54 = init_55_arg_1 [L156] SORT_3 init_57_arg_1 = var_6; [L157] state_56 = init_57_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_208 = __VERIFIER_nondet_ushort() [L164] input_209 = __VERIFIER_nondet_ushort() [L165] input_210 = __VERIFIER_nondet_ushort() [L166] input_219 = __VERIFIER_nondet_ushort() [L167] input_228 = __VERIFIER_nondet_ushort() [L168] input_229 = __VERIFIER_nondet_ushort() [L169] input_230 = __VERIFIER_nondet_ushort() [L170] input_233 = __VERIFIER_nondet_ushort() [L171] input_251 = __VERIFIER_nondet_ushort() [L172] input_252 = __VERIFIER_nondet_ushort() [L173] input_253 = __VERIFIER_nondet_ushort() [L174] input_256 = __VERIFIER_nondet_ushort() [L175] input_258 = __VERIFIER_nondet_ushort() [L176] input_272 = __VERIFIER_nondet_uchar() [L177] input_273 = __VERIFIER_nondet_uchar() [L178] input_274 = __VERIFIER_nondet_uchar() [L181] SORT_3 var_10_arg_0 = state_7; [L182] SORT_9 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] EXPR var_10 & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] var_10 = var_10 & mask_SORT_9 [L184] SORT_9 var_12_arg_0 = var_10; [L185] SORT_9 var_12_arg_1 = var_11; [L186] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L187] SORT_9 var_16_arg_0 = state_14; [L188] SORT_1 var_16 = var_16_arg_0 >> 2; [L189] SORT_1 var_17_arg_0 = var_12; [L190] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_17_arg_0=0, var_17_arg_1=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L192] SORT_1 var_18_arg_0 = var_17; [L193] SORT_1 var_18 = ~var_18_arg_0; [L194] SORT_1 var_22_arg_0 = state_20; [L195] SORT_1 var_22 = ~var_22_arg_0; [L196] SORT_3 var_25_arg_0 = state_23; [L197] SORT_3 var_25_arg_1 = var_6; [L198] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L199] SORT_1 var_26_arg_0 = var_22; [L200] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26_arg_0=-1, var_26_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L202] SORT_3 var_27_arg_0 = state_23; [L203] SORT_3 var_27_arg_1 = var_6; [L204] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L205] SORT_1 var_28_arg_0 = var_27; [L206] SORT_1 var_28 = ~var_28_arg_0; [L207] SORT_1 var_29_arg_0 = var_28; [L208] SORT_1 var_29_arg_1 = state_20; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_29_arg_0=-2, var_29_arg_1=0, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] EXPR var_29_arg_0 | var_29_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] SORT_1 var_29 = var_29_arg_0 | var_29_arg_1; [L210] SORT_1 var_30_arg_0 = var_26; [L211] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_30_arg_0=255, var_30_arg_1=254, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L213] SORT_1 var_31_arg_0 = var_18; [L214] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_31_arg_0=-1, var_31_arg_1=253, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L216] SORT_1 var_35_arg_0 = var_31; [L217] SORT_1 var_35 = ~var_35_arg_0; [L218] SORT_1 var_36_arg_0 = var_34; [L219] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_36_arg_0=1, var_36_arg_1=-1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] EXPR var_36_arg_0 & var_36_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L221] EXPR var_36 & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L221] var_36 = var_36 & mask_SORT_1 [L222] SORT_1 bad_37_arg_0 = var_36; [L223] CALL __VERIFIER_assert(!(bad_37_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1351 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16905 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16905 mSDsluCounter, 92124 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72056 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19283 IncrementalHoareTripleChecker+Invalid, 19290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20068 mSDtfsCounter, 19283 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1418occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1069 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 1868 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-03 18:31:59,882 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.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:01,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:01,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:32:01,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:01,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:01,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:01,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:01,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:01,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:01,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:01,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:01,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:01,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:01,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:01,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:01,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:01,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:01,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:01,771 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2025-03-03 18:32:02,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:02,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:02,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:02,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:02,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:02,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:32:03,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d784d4d4/8693735940b946f0add0b85ace85607c/FLAGf92817c4f [2025-03-03 18:32:03,443 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:03,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:32:03,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d784d4d4/8693735940b946f0add0b85ace85607c/FLAGf92817c4f [2025-03-03 18:32:03,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d784d4d4/8693735940b946f0add0b85ace85607c [2025-03-03 18:32:03,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:03,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:03,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:03,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:03,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:03,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:03" (1/1) ... [2025-03-03 18:32:03,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f186f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:03, skipping insertion in model container [2025-03-03 18:32:03,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:03" (1/1) ... [2025-03-03 18:32:03,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:03,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-03 18:32:03,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:03,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:03,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-03 18:32:04,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:04,036 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:04,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04 WrapperNode [2025-03-03 18:32:04,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:04,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:04,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:04,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:04,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,136 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1832 [2025-03-03 18:32:04,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:04,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:04,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:04,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:04,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,227 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:32:04,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:04,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:04,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:04,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:04,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (1/1) ... [2025-03-03 18:32:04,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:04,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:32:04,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:32:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:32:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:04,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:04,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:06,587 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:06,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:06,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:06,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:06,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:06 BoogieIcfgContainer [2025-03-03 18:32:06,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:06,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:06,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:06,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:06,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:03" (1/3) ... [2025-03-03 18:32:06,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aadc068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:06, skipping insertion in model container [2025-03-03 18:32:06,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:04" (2/3) ... [2025-03-03 18:32:06,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aadc068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:06, skipping insertion in model container [2025-03-03 18:32:06,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:06" (3/3) ... [2025-03-03 18:32:06,603 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-03 18:32:06,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:06,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:06,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:06,654 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;@27111ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:06,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:32:06,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:06,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:32:06,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:32:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947272650] [2025-03-03 18:32:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:06,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:06,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:06,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:06,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:32:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:32:07,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:32:07,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:07,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:07,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 18:32:07,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:07,159 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-03 18:32:07,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:32:07,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:07,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947272650] [2025-03-03 18:32:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947272650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:07,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376615650] [2025-03-03 18:32:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:07,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:07,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:07,184 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:07,291 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:32:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 18:32:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:07,297 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:32:07,297 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:32:07,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:07,301 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:07,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:32:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:32:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:32:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:32:07,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:32:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:07,323 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:32:07,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:32:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:32:07,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:07,324 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:07,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:32:07,528 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-03 18:32:07,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:07,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:32:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159563632] [2025-03-03 18:32:07,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:07,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:07,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:07,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:07,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:32:07,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:32:07,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:32:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:07,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:32:07,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:08,131 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-03 18:32:08,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:32:08,369 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-03 18:32:08,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159563632] [2025-03-03 18:32:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159563632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:32:08,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:32:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:32:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584374477] [2025-03-03 18:32:08,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:32:08,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:32:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:08,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:32:08,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:32:08,372 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:08,745 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-03 18:32:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:32:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 18:32:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:08,746 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:32:08,746 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 18:32:08,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:32:08,747 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:08,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 18:32:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 18:32:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-03 18:32:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 18:32:08,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-03 18:32:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 18:32:08,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 18:32:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 18:32:08,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:08,751 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 18:32:08,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:32:08,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:08,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-03 18:32:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:08,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27665277] [2025-03-03 18:32:08,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:32:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:08,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:08,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:32:09,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 18:32:09,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 18:32:09,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:32:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:09,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:32:09,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:09,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:32:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:10,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27665277] [2025-03-03 18:32:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27665277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:32:10,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:32:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 18:32:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280555155] [2025-03-03 18:32:10,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:32:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:32:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:10,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:32:10,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:32:10,485 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-03 18:32:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:11,498 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-03 18:32:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:32:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2025-03-03 18:32:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:11,499 INFO L225 Difference]: With dead ends: 32 [2025-03-03 18:32:11,499 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 18:32:11,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:32:11,499 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:11,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 18:32:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-03 18:32:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-03 18:32:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-03-03 18:32:11,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2025-03-03 18:32:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:11,508 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-03-03 18:32:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-03 18:32:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-03-03 18:32:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 18:32:11,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:11,509 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-03 18:32:11,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:32:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:11,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:11,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -209850681, now seen corresponding path program 3 times [2025-03-03 18:32:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410560372] [2025-03-03 18:32:11,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 18:32:11,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:11,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:11,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:11,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:32:12,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 5 equivalence classes. [2025-03-03 18:32:12,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 18:32:12,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 18:32:12,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:12,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-03 18:32:12,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:58,268 INFO L312 TraceCheckSpWp]: Computing backward predicates...