./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:05:41,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:05:41,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:05:41,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:05:41,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:05:41,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:05:41,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:05:41,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:05:41,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:05:41,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:05:41,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:05:41,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:05:41,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:05:41,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:05:41,980 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:05:41,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:05:41,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:05:41,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:05:41,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:05:41,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:05:41,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:05:41,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:05:41,982 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-jdk21/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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-02-07 22:05:42,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:05:42,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:05:42,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:05:42,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:05:42,219 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:05:42,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:05:43,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eae99af2f/a1000a29f3fb4c739e77a8ef66ff12d4/FLAG1c7f39cd3 [2025-02-07 22:05:44,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:05:44,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:05:44,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eae99af2f/a1000a29f3fb4c739e77a8ef66ff12d4/FLAG1c7f39cd3 [2025-02-07 22:05:44,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eae99af2f/a1000a29f3fb4c739e77a8ef66ff12d4 [2025-02-07 22:05:44,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:05:44,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:05:44,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:05:44,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:05:44,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:05:44,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39722f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44, skipping insertion in model container [2025-02-07 22:05:44,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:05:44,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:05:44,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:05:44,356 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:05:44,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:05:44,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:05:44,448 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:05:44,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44 WrapperNode [2025-02-07 22:05:44,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:05:44,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:05:44,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:05:44,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:05:44,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,604 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2025-02-07 22:05:44,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:05:44,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:05:44,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:05:44,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:05:44,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,685 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-02-07 22:05:44,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:05:44,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:05:44,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:05:44,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:05:44,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (1/1) ... [2025-02-07 22:05:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:05:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:05:44,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:05:44,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:05:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:05:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:05:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:05:44,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:05:45,101 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:05:45,102 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:05:46,565 INFO L? ?]: Removed 855 outVars from TransFormulas that were not future-live. [2025-02-07 22:05:46,566 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:05:46,671 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:05:46,674 INFO L337 CfgBuilder]: Removed 3 assume(true) statements. [2025-02-07 22:05:46,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:05:46 BoogieIcfgContainer [2025-02-07 22:05:46,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:05:46,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:05:46,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:05:46,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:05:46,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:05:44" (1/3) ... [2025-02-07 22:05:46,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:05:46, skipping insertion in model container [2025-02-07 22:05:46,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:05:44" (2/3) ... [2025-02-07 22:05:46,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:05:46, skipping insertion in model container [2025-02-07 22:05:46,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:05:46" (3/3) ... [2025-02-07 22:05:46,684 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:05:46,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:05:46,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 595 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:05:46,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:05:46,778 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;@3322965c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:05:46,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:05:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 594 states have internal predecessors, (892), 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-02-07 22:05:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 22:05:46,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:46,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:46,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1705196510, now seen corresponding path program 1 times [2025-02-07 22:05:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304077494] [2025-02-07 22:05:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:46,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 22:05:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 22:05:47,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:47,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304077494] [2025-02-07 22:05:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304077494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:05:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511787149] [2025-02-07 22:05:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:47,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:47,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:47,402 INFO L87 Difference]: Start difference. First operand has 595 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 594 states have internal predecessors, (892), 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 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-02-07 22:05:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:47,819 INFO L93 Difference]: Finished difference Result 1147 states and 1722 transitions. [2025-02-07 22:05:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2025-02-07 22:05:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:47,837 INFO L225 Difference]: With dead ends: 1147 [2025-02-07 22:05:47,838 INFO L226 Difference]: Without dead ends: 593 [2025-02-07 22:05:47,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-07 22:05:47,849 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 858 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:47,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1467 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-07 22:05:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-07 22:05:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.5) internal successors, (888), 592 states have internal predecessors, (888), 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-02-07 22:05:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 888 transitions. [2025-02-07 22:05:47,926 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 888 transitions. Word has length 58 [2025-02-07 22:05:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:47,926 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 888 transitions. [2025-02-07 22:05:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-02-07 22:05:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 888 transitions. [2025-02-07 22:05:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-07 22:05:47,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:47,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:05:47,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1060828836, now seen corresponding path program 1 times [2025-02-07 22:05:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004297031] [2025-02-07 22:05:47,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-07 22:05:47,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-07 22:05:47,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:48,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004297031] [2025-02-07 22:05:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004297031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:05:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663329142] [2025-02-07 22:05:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:48,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 22:05:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 22:05:48,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:05:48,143 INFO L87 Difference]: Start difference. First operand 593 states and 888 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-07 22:05:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:48,555 INFO L93 Difference]: Finished difference Result 1146 states and 1717 transitions. [2025-02-07 22:05:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 22:05:48,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2025-02-07 22:05:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:48,558 INFO L225 Difference]: With dead ends: 1146 [2025-02-07 22:05:48,558 INFO L226 Difference]: Without dead ends: 594 [2025-02-07 22:05:48,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:05:48,559 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:48,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1475 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:05:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-07 22:05:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-02-07 22:05:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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-02-07 22:05:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2025-02-07 22:05:48,588 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2025-02-07 22:05:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2025-02-07 22:05:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-07 22:05:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2025-02-07 22:05:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-07 22:05:48,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:48,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:48,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:05:48,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:48,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 588360701, now seen corresponding path program 1 times [2025-02-07 22:05:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77723941] [2025-02-07 22:05:48,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:48,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-07 22:05:48,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-07 22:05:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77723941] [2025-02-07 22:05:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77723941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410582686] [2025-02-07 22:05:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:48,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:48,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:48,874 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-07 22:05:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:49,141 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2025-02-07 22:05:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:49,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-02-07 22:05:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:49,144 INFO L225 Difference]: With dead ends: 598 [2025-02-07 22:05:49,144 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:05:49,145 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-02-07 22:05:49,145 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:49,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2212 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:05:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:05:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:05:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 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-02-07 22:05:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2025-02-07 22:05:49,158 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 59 [2025-02-07 22:05:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:49,159 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2025-02-07 22:05:49,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-07 22:05:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2025-02-07 22:05:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 22:05:49,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:49,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:49,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:05:49,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992516, now seen corresponding path program 1 times [2025-02-07 22:05:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85393880] [2025-02-07 22:05:49,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 22:05:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 22:05:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85393880] [2025-02-07 22:05:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85393880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592718473] [2025-02-07 22:05:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:49,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:49,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:49,269 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-07 22:05:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:49,505 INFO L93 Difference]: Finished difference Result 1153 states and 1724 transitions. [2025-02-07 22:05:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-02-07 22:05:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:49,507 INFO L225 Difference]: With dead ends: 1153 [2025-02-07 22:05:49,508 INFO L226 Difference]: Without dead ends: 598 [2025-02-07 22:05:49,508 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-02-07 22:05:49,509 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:49,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2209 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:05:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-02-07 22:05:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-02-07 22:05:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 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-02-07 22:05:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2025-02-07 22:05:49,519 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 60 [2025-02-07 22:05:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:49,519 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2025-02-07 22:05:49,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-07 22:05:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2025-02-07 22:05:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 22:05:49,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:49,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:05:49,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash 555539672, now seen corresponding path program 1 times [2025-02-07 22:05:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716934514] [2025-02-07 22:05:49,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:49,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 22:05:49,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 22:05:49,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:49,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:49,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-02-07 22:05:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716934514] [2025-02-07 22:05:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716934514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613886227] [2025-02-07 22:05:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:49,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:49,737 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-02-07 22:05:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:49,975 INFO L93 Difference]: Finished difference Result 1157 states and 1728 transitions. [2025-02-07 22:05:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-02-07 22:05:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:49,978 INFO L225 Difference]: With dead ends: 1157 [2025-02-07 22:05:49,978 INFO L226 Difference]: Without dead ends: 600 [2025-02-07 22:05:49,979 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-02-07 22:05:49,979 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:49,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2204 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:05:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-07 22:05:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-07 22:05:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 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-02-07 22:05:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2025-02-07 22:05:49,988 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 61 [2025-02-07 22:05:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:49,989 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2025-02-07 22:05:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-02-07 22:05:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2025-02-07 22:05:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 22:05:49,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:49,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:49,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:05:49,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1930223977, now seen corresponding path program 1 times [2025-02-07 22:05:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697278529] [2025-02-07 22:05:49,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:50,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 22:05:50,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 22:05:50,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:50,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697278529] [2025-02-07 22:05:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697278529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:05:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437224769] [2025-02-07 22:05:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:50,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:50,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:50,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:50,283 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-07 22:05:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:50,619 INFO L93 Difference]: Finished difference Result 1163 states and 1735 transitions. [2025-02-07 22:05:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:05:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2025-02-07 22:05:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:50,622 INFO L225 Difference]: With dead ends: 1163 [2025-02-07 22:05:50,622 INFO L226 Difference]: Without dead ends: 604 [2025-02-07 22:05:50,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:50,623 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 4 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:50,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2931 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-07 22:05:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-02-07 22:05:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 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-02-07 22:05:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2025-02-07 22:05:50,636 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 62 [2025-02-07 22:05:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:50,636 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2025-02-07 22:05:50,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-07 22:05:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2025-02-07 22:05:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-07 22:05:50,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:50,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:50,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:05:50,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 527262894, now seen corresponding path program 1 times [2025-02-07 22:05:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163530122] [2025-02-07 22:05:50,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-07 22:05:50,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 22:05:50,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:50,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163530122] [2025-02-07 22:05:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163530122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:05:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391725559] [2025-02-07 22:05:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:05:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:51,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:05:51,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:05:51,099 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-02-07 22:05:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:51,676 INFO L93 Difference]: Finished difference Result 1174 states and 1751 transitions. [2025-02-07 22:05:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:05:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2025-02-07 22:05:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:51,680 INFO L225 Difference]: With dead ends: 1174 [2025-02-07 22:05:51,680 INFO L226 Difference]: Without dead ends: 613 [2025-02-07 22:05:51,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:05:51,682 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 870 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:51,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2834 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:05:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-07 22:05:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2025-02-07 22:05:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4908789386401327) internal successors, (899), 603 states have internal predecessors, (899), 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-02-07 22:05:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 899 transitions. [2025-02-07 22:05:51,701 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 899 transitions. Word has length 63 [2025-02-07 22:05:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:51,701 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 899 transitions. [2025-02-07 22:05:51,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-02-07 22:05:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 899 transitions. [2025-02-07 22:05:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-07 22:05:51,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:51,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:51,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:05:51,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:51,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -48315926, now seen corresponding path program 1 times [2025-02-07 22:05:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108480334] [2025-02-07 22:05:51,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:51,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-07 22:05:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-07 22:05:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108480334] [2025-02-07 22:05:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108480334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848232302] [2025-02-07 22:05:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:51,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:51,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:51,867 INFO L87 Difference]: Start difference. First operand 604 states and 899 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-02-07 22:05:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:52,280 INFO L93 Difference]: Finished difference Result 1194 states and 1777 transitions. [2025-02-07 22:05:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:05:52,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-07 22:05:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:52,283 INFO L225 Difference]: With dead ends: 1194 [2025-02-07 22:05:52,283 INFO L226 Difference]: Without dead ends: 631 [2025-02-07 22:05:52,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:52,285 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 64 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:52,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2895 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:05:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-07 22:05:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2025-02-07 22:05:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.488888888888889) internal successors, (938), 630 states have internal predecessors, (938), 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-02-07 22:05:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 938 transitions. [2025-02-07 22:05:52,302 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 938 transitions. Word has length 63 [2025-02-07 22:05:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:52,303 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 938 transitions. [2025-02-07 22:05:52,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-02-07 22:05:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 938 transitions. [2025-02-07 22:05:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-07 22:05:52,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:52,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:52,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:05:52,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:52,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash -765089958, now seen corresponding path program 1 times [2025-02-07 22:05:52,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833434609] [2025-02-07 22:05:52,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:52,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-07 22:05:52,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-07 22:05:52,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:52,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:52,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:52,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833434609] [2025-02-07 22:05:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833434609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:52,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:05:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492800412] [2025-02-07 22:05:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:52,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:05:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:52,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:05:52,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:05:52,474 INFO L87 Difference]: Start difference. First operand 631 states and 938 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-02-07 22:05:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:52,764 INFO L93 Difference]: Finished difference Result 1193 states and 1775 transitions. [2025-02-07 22:05:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2025-02-07 22:05:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:52,768 INFO L225 Difference]: With dead ends: 1193 [2025-02-07 22:05:52,768 INFO L226 Difference]: Without dead ends: 630 [2025-02-07 22:05:52,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-07 22:05:52,770 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 850 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:52,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1466 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-07 22:05:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-02-07 22:05:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.4880763116057234) internal successors, (936), 629 states have internal predecessors, (936), 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-02-07 22:05:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 936 transitions. [2025-02-07 22:05:52,780 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 936 transitions. Word has length 64 [2025-02-07 22:05:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 936 transitions. [2025-02-07 22:05:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-02-07 22:05:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 936 transitions. [2025-02-07 22:05:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-07 22:05:52,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:52,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:52,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:05:52,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 126668047, now seen corresponding path program 1 times [2025-02-07 22:05:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103224599] [2025-02-07 22:05:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-07 22:05:52,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-07 22:05:52,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:52,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:52,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103224599] [2025-02-07 22:05:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103224599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:52,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:52,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35362783] [2025-02-07 22:05:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:52,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:52,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:52,985 INFO L87 Difference]: Start difference. First operand 630 states and 936 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-02-07 22:05:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:53,316 INFO L93 Difference]: Finished difference Result 1192 states and 1774 transitions. [2025-02-07 22:05:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:05:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-02-07 22:05:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:53,319 INFO L225 Difference]: With dead ends: 1192 [2025-02-07 22:05:53,319 INFO L226 Difference]: Without dead ends: 630 [2025-02-07 22:05:53,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:53,321 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 848 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:53,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1394 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:05:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-07 22:05:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2025-02-07 22:05:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4832535885167464) internal successors, (930), 627 states have internal predecessors, (930), 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-02-07 22:05:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 930 transitions. [2025-02-07 22:05:53,334 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 930 transitions. Word has length 64 [2025-02-07 22:05:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:53,335 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 930 transitions. [2025-02-07 22:05:53,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-02-07 22:05:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 930 transitions. [2025-02-07 22:05:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-07 22:05:53,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:53,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:05:53,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2127469222, now seen corresponding path program 1 times [2025-02-07 22:05:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485391784] [2025-02-07 22:05:53,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:53,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-07 22:05:53,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-07 22:05:53,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485391784] [2025-02-07 22:05:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485391784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:05:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030443818] [2025-02-07 22:05:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:05:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:53,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:05:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:05:53,784 INFO L87 Difference]: Start difference. First operand 628 states and 930 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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-02-07 22:05:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:54,589 INFO L93 Difference]: Finished difference Result 1204 states and 1782 transitions. [2025-02-07 22:05:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:05:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2025-02-07 22:05:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:54,591 INFO L225 Difference]: With dead ends: 1204 [2025-02-07 22:05:54,591 INFO L226 Difference]: Without dead ends: 644 [2025-02-07 22:05:54,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:05:54,592 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 867 mSDsluCounter, 4939 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:54,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 5661 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:05:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-07 22:05:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 639. [2025-02-07 22:05:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.4780564263322884) internal successors, (943), 638 states have internal predecessors, (943), 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-02-07 22:05:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 943 transitions. [2025-02-07 22:05:54,602 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 943 transitions. Word has length 65 [2025-02-07 22:05:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:54,602 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 943 transitions. [2025-02-07 22:05:54,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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-02-07 22:05:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 943 transitions. [2025-02-07 22:05:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-07 22:05:54,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:54,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:05:54,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 648457236, now seen corresponding path program 1 times [2025-02-07 22:05:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508361449] [2025-02-07 22:05:54,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-07 22:05:54,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-07 22:05:54,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:54,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:54,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508361449] [2025-02-07 22:05:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508361449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:54,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:05:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008488551] [2025-02-07 22:05:54,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:54,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:05:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:54,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:05:54,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:05:54,847 INFO L87 Difference]: Start difference. First operand 639 states and 943 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02-07 22:05:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:55,349 INFO L93 Difference]: Finished difference Result 1214 states and 1792 transitions. [2025-02-07 22:05:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:05:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2025-02-07 22:05:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:55,352 INFO L225 Difference]: With dead ends: 1214 [2025-02-07 22:05:55,352 INFO L226 Difference]: Without dead ends: 643 [2025-02-07 22:05:55,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:05:55,354 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 9 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:55,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3596 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:05:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-07 22:05:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2025-02-07 22:05:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.4773082942097027) internal successors, (944), 639 states have internal predecessors, (944), 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-02-07 22:05:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 944 transitions. [2025-02-07 22:05:55,371 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 944 transitions. Word has length 65 [2025-02-07 22:05:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:55,371 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 944 transitions. [2025-02-07 22:05:55,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02-07 22:05:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 944 transitions. [2025-02-07 22:05:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-07 22:05:55,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:55,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:55,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:05:55,373 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:55,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1573930961, now seen corresponding path program 1 times [2025-02-07 22:05:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158754964] [2025-02-07 22:05:55,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:55,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:55,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-07 22:05:55,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 22:05:55,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:55,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158754964] [2025-02-07 22:05:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158754964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:05:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283635621] [2025-02-07 22:05:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:55,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:05:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:55,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:05:55,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:05:55,796 INFO L87 Difference]: Start difference. First operand 640 states and 944 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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-02-07 22:05:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:56,587 INFO L93 Difference]: Finished difference Result 1223 states and 1803 transitions. [2025-02-07 22:05:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:05:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2025-02-07 22:05:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:56,590 INFO L225 Difference]: With dead ends: 1223 [2025-02-07 22:05:56,590 INFO L226 Difference]: Without dead ends: 651 [2025-02-07 22:05:56,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:05:56,591 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 856 mSDsluCounter, 5638 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:56,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 6361 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:05:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-07 22:05:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 643. [2025-02-07 22:05:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4766355140186915) internal successors, (948), 642 states have internal predecessors, (948), 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-02-07 22:05:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 948 transitions. [2025-02-07 22:05:56,600 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 948 transitions. Word has length 66 [2025-02-07 22:05:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:56,600 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 948 transitions. [2025-02-07 22:05:56,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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-02-07 22:05:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 948 transitions. [2025-02-07 22:05:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 22:05:56,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:56,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:56,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:05:56,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1819355991, now seen corresponding path program 1 times [2025-02-07 22:05:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759818715] [2025-02-07 22:05:56,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:56,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 22:05:56,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 22:05:56,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:56,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:56,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759818715] [2025-02-07 22:05:56,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759818715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:56,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:56,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:05:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037154310] [2025-02-07 22:05:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:56,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:05:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:56,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:05:56,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:05:56,772 INFO L87 Difference]: Start difference. First operand 643 states and 948 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-07 22:05:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:57,248 INFO L93 Difference]: Finished difference Result 1227 states and 1807 transitions. [2025-02-07 22:05:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:05:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2025-02-07 22:05:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:57,250 INFO L225 Difference]: With dead ends: 1227 [2025-02-07 22:05:57,250 INFO L226 Difference]: Without dead ends: 652 [2025-02-07 22:05:57,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:05:57,251 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 6 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:57,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5013 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:05:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-07 22:05:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2025-02-07 22:05:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.473035439137134) internal successors, (956), 649 states have internal predecessors, (956), 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-02-07 22:05:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 956 transitions. [2025-02-07 22:05:57,260 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 956 transitions. Word has length 67 [2025-02-07 22:05:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:57,260 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 956 transitions. [2025-02-07 22:05:57,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-07 22:05:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 956 transitions. [2025-02-07 22:05:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 22:05:57,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:57,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:05:57,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash -522171073, now seen corresponding path program 1 times [2025-02-07 22:05:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052882696] [2025-02-07 22:05:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 22:05:57,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 22:05:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:57,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052882696] [2025-02-07 22:05:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052882696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:57,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:57,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:05:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872764798] [2025-02-07 22:05:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:57,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:05:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:57,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:05:57,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:05:57,515 INFO L87 Difference]: Start difference. First operand 650 states and 956 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-02-07 22:05:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:57,910 INFO L93 Difference]: Finished difference Result 1240 states and 1823 transitions. [2025-02-07 22:05:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:05:57,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2025-02-07 22:05:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:57,912 INFO L225 Difference]: With dead ends: 1240 [2025-02-07 22:05:57,912 INFO L226 Difference]: Without dead ends: 658 [2025-02-07 22:05:57,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:05:57,913 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 835 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:57,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 3642 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:05:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-07 22:05:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 654. [2025-02-07 22:05:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.4732006125574273) internal successors, (962), 653 states have internal predecessors, (962), 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-02-07 22:05:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 962 transitions. [2025-02-07 22:05:57,934 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 962 transitions. Word has length 67 [2025-02-07 22:05:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:57,935 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 962 transitions. [2025-02-07 22:05:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-02-07 22:05:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 962 transitions. [2025-02-07 22:05:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-07 22:05:57,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:57,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:05:57,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1692364189, now seen corresponding path program 1 times [2025-02-07 22:05:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439748628] [2025-02-07 22:05:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:57,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-07 22:05:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-07 22:05:57,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439748628] [2025-02-07 22:05:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439748628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:05:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807224949] [2025-02-07 22:05:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:58,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:05:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:58,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:05:58,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:05:58,095 INFO L87 Difference]: Start difference. First operand 654 states and 962 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-07 22:05:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:05:58,947 INFO L93 Difference]: Finished difference Result 1771 states and 2605 transitions. [2025-02-07 22:05:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:05:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-02-07 22:05:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:05:58,951 INFO L225 Difference]: With dead ends: 1771 [2025-02-07 22:05:58,951 INFO L226 Difference]: Without dead ends: 1185 [2025-02-07 22:05:58,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:05:58,953 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 797 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:05:58,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2174 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:05:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-02-07 22:05:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 707. [2025-02-07 22:05:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.4589235127478755) internal successors, (1030), 706 states have internal predecessors, (1030), 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-02-07 22:05:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1030 transitions. [2025-02-07 22:05:58,965 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1030 transitions. Word has length 68 [2025-02-07 22:05:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:05:58,965 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1030 transitions. [2025-02-07 22:05:58,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-07 22:05:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1030 transitions. [2025-02-07 22:05:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 22:05:58,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:05:58,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:05:58,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:05:58,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:05:58,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:05:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -362295451, now seen corresponding path program 1 times [2025-02-07 22:05:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:05:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288036635] [2025-02-07 22:05:58,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:05:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:05:59,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 22:05:59,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 22:05:59,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:05:59,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:05:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:05:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:05:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288036635] [2025-02-07 22:05:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288036635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:05:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:05:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:05:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287006977] [2025-02-07 22:05:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:05:59,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:05:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:05:59,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:05:59,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:05:59,376 INFO L87 Difference]: Start difference. First operand 707 states and 1030 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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-02-07 22:06:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:00,061 INFO L93 Difference]: Finished difference Result 1838 states and 2705 transitions. [2025-02-07 22:06:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:06:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2025-02-07 22:06:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:00,065 INFO L225 Difference]: With dead ends: 1838 [2025-02-07 22:06:00,065 INFO L226 Difference]: Without dead ends: 1233 [2025-02-07 22:06:00,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:06:00,066 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 2320 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:00,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 3466 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:06:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-02-07 22:06:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 723. [2025-02-07 22:06:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.448753462603878) internal successors, (1046), 722 states have internal predecessors, (1046), 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-02-07 22:06:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1046 transitions. [2025-02-07 22:06:00,077 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1046 transitions. Word has length 69 [2025-02-07 22:06:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:00,077 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1046 transitions. [2025-02-07 22:06:00,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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-02-07 22:06:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1046 transitions. [2025-02-07 22:06:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 22:06:00,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:00,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:06:00,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:00,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1754334299, now seen corresponding path program 1 times [2025-02-07 22:06:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936968559] [2025-02-07 22:06:00,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 22:06:00,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 22:06:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:00,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936968559] [2025-02-07 22:06:00,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936968559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:00,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:00,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:06:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903461631] [2025-02-07 22:06:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:06:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:00,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:06:00,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:06:00,380 INFO L87 Difference]: Start difference. First operand 723 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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-02-07 22:06:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:01,017 INFO L93 Difference]: Finished difference Result 1357 states and 1968 transitions. [2025-02-07 22:06:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:06:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2025-02-07 22:06:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:01,020 INFO L225 Difference]: With dead ends: 1357 [2025-02-07 22:06:01,020 INFO L226 Difference]: Without dead ends: 734 [2025-02-07 22:06:01,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:06:01,021 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 869 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:01,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4156 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-02-07 22:06:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 726. [2025-02-07 22:06:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 725 states have internal predecessors, (1048), 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-02-07 22:06:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1048 transitions. [2025-02-07 22:06:01,030 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1048 transitions. Word has length 70 [2025-02-07 22:06:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:01,031 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1048 transitions. [2025-02-07 22:06:01,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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-02-07 22:06:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1048 transitions. [2025-02-07 22:06:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 22:06:01,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:01,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:01,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:06:01,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:01,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1000435918, now seen corresponding path program 1 times [2025-02-07 22:06:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:01,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228685613] [2025-02-07 22:06:01,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:01,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 22:06:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 22:06:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:01,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228685613] [2025-02-07 22:06:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228685613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:06:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142955432] [2025-02-07 22:06:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:01,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:06:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:01,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:06:01,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:06:01,246 INFO L87 Difference]: Start difference. First operand 726 states and 1048 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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-02-07 22:06:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:01,739 INFO L93 Difference]: Finished difference Result 1335 states and 1937 transitions. [2025-02-07 22:06:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:06:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2025-02-07 22:06:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:01,743 INFO L225 Difference]: With dead ends: 1335 [2025-02-07 22:06:01,743 INFO L226 Difference]: Without dead ends: 737 [2025-02-07 22:06:01,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:06:01,744 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 824 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:01,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 3507 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:06:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-02-07 22:06:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 726. [2025-02-07 22:06:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 725 states have internal predecessors, (1048), 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-02-07 22:06:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1048 transitions. [2025-02-07 22:06:01,754 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1048 transitions. Word has length 70 [2025-02-07 22:06:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1048 transitions. [2025-02-07 22:06:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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-02-07 22:06:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1048 transitions. [2025-02-07 22:06:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 22:06:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:01,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:06:01,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -345267187, now seen corresponding path program 1 times [2025-02-07 22:06:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423092078] [2025-02-07 22:06:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 22:06:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 22:06:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423092078] [2025-02-07 22:06:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423092078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:01,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:06:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663513075] [2025-02-07 22:06:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:01,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:06:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:01,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:06:01,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:06:01,901 INFO L87 Difference]: Start difference. First operand 726 states and 1048 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02-07 22:06:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:02,265 INFO L93 Difference]: Finished difference Result 1341 states and 1946 transitions. [2025-02-07 22:06:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:06:02,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-02-07 22:06:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:02,267 INFO L225 Difference]: With dead ends: 1341 [2025-02-07 22:06:02,268 INFO L226 Difference]: Without dead ends: 726 [2025-02-07 22:06:02,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:06:02,268 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 871 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:02,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1404 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:06:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-07 22:06:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 720. [2025-02-07 22:06:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 1.4464534075104312) internal successors, (1040), 719 states have internal predecessors, (1040), 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-02-07 22:06:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1040 transitions. [2025-02-07 22:06:02,296 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1040 transitions. Word has length 71 [2025-02-07 22:06:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:02,296 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1040 transitions. [2025-02-07 22:06:02,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02-07 22:06:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1040 transitions. [2025-02-07 22:06:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 22:06:02,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:02,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:06:02,297 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 478994285, now seen corresponding path program 1 times [2025-02-07 22:06:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766027633] [2025-02-07 22:06:02,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:02,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 22:06:02,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 22:06:02,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:06:02,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766027633] [2025-02-07 22:06:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766027633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:02,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:06:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781528132] [2025-02-07 22:06:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:02,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:06:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:06:02,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:06:02,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:06:02,492 INFO L87 Difference]: Start difference. First operand 720 states and 1040 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-02-07 22:06:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:02,969 INFO L93 Difference]: Finished difference Result 1338 states and 1941 transitions. [2025-02-07 22:06:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:06:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-02-07 22:06:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:02,972 INFO L225 Difference]: With dead ends: 1338 [2025-02-07 22:06:02,972 INFO L226 Difference]: Without dead ends: 733 [2025-02-07 22:06:02,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:06:02,973 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 5 mSDsluCounter, 4324 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5050 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:02,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5050 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:06:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-02-07 22:06:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 716. [2025-02-07 22:06:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4489510489510489) internal successors, (1036), 715 states have internal predecessors, (1036), 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-02-07 22:06:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1036 transitions. [2025-02-07 22:06:02,985 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1036 transitions. Word has length 71 [2025-02-07 22:06:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1036 transitions. [2025-02-07 22:06:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-02-07 22:06:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1036 transitions. [2025-02-07 22:06:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 22:06:02,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:02,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:06:02,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -901705259, now seen corresponding path program 1 times [2025-02-07 22:06:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:06:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720472419] [2025-02-07 22:06:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:06:02,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 22:06:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 22:06:03,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:06:03,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:06:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 22:06:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 22:06:03,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:06:03,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:06:03,077 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:06:03,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:06:03,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:06:03,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:06:03,121 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:06:03,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:06:03,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:06:03 BoogieIcfgContainer [2025-02-07 22:06:03,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:06:03,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:06:03,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:06:03,131 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:06:03,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:05:46" (3/4) ... [2025-02-07 22:06:03,133 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:06:03,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:06:03,134 INFO L158 Benchmark]: Toolchain (without parser) took 19018.68ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 129.8MB in the beginning and 166.6MB in the end (delta: -36.8MB). Peak memory consumption was 280.4MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,134 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:06:03,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.21ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 103.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 155.35ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 64.6MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,134 INFO L158 Benchmark]: Boogie Preprocessor took 198.73ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 46.2MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,135 INFO L158 Benchmark]: IcfgBuilder took 1869.94ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 46.2MB in the beginning and 222.3MB in the end (delta: -176.1MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,135 INFO L158 Benchmark]: TraceAbstraction took 16452.63ms. Allocated memory was 335.5MB in the beginning and 486.5MB in the end (delta: 151.0MB). Free memory was 222.3MB in the beginning and 166.7MB in the end (delta: 55.6MB). Peak memory consumption was 205.9MB. Max. memory is 16.1GB. [2025-02-07 22:06:03,135 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 486.5MB. Free memory was 166.7MB in the beginning and 166.6MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:06:03,136 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.44ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.21ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 103.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 155.35ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 64.6MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 198.73ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 46.2MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1869.94ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 46.2MB in the beginning and 222.3MB in the end (delta: -176.1MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16452.63ms. Allocated memory was 335.5MB in the beginning and 486.5MB in the end (delta: 151.0MB). Free memory was 222.3MB in the beginning and 166.7MB in the end (delta: 55.6MB). Peak memory consumption was 205.9MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 486.5MB. Free memory was 166.7MB in the beginning and 166.6MB in the end (delta: 40.7kB). 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 110, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 107, overapproximation of bitwiseAnd at line 116. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 500; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 200; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=200] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=200] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=-2, var_33_arg_1=16, var_79=200] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=200] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_79=200] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=200] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 595 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11753 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11753 mSDsluCounter, 65117 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50087 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16004 IncrementalHoareTripleChecker+Invalid, 16029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 15030 mSDtfsCounter, 16004 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=18, InterpolantAutomatonStates: 123, 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, 21 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1434 NumberOfCodeBlocks, 1434 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1341 ConstructedInterpolants, 0 QuantifiedInterpolants, 4530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-02-07 22:06:03,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:06:05,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:06:05,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:06:05,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:06:05,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:06:05,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:06:05,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:06:05,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:06:05,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:06:05,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:06:05,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:06:05,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:06:05,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:06:05,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:06:05,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:06:05,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:06:05,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:06:05,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:06:05,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:06:05,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:06:05,644 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-jdk21/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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-02-07 22:06:05,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:06:05,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:06:05,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:06:05,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:06:05,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:06:05,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:06:07,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b12ce4c0/19fcc65b43a64a549c7588a98f6e8d30/FLAGa62c4dcb6 [2025-02-07 22:06:07,774 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:06:07,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:06:07,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b12ce4c0/19fcc65b43a64a549c7588a98f6e8d30/FLAGa62c4dcb6 [2025-02-07 22:06:07,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b12ce4c0/19fcc65b43a64a549c7588a98f6e8d30 [2025-02-07 22:06:07,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:06:07,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:06:07,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:06:07,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:06:07,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:06:07,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:06:07" (1/1) ... [2025-02-07 22:06:07,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de03742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:07, skipping insertion in model container [2025-02-07 22:06:07,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:06:07" (1/1) ... [2025-02-07 22:06:07,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:06:08,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:06:08,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:06:08,107 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:06:08,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:06:08,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:06:08,192 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:06:08,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08 WrapperNode [2025-02-07 22:06:08,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:06:08,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:06:08,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:06:08,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:06:08,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,255 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2025-02-07 22:06:08,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:06:08,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:06:08,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:06:08,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:06:08,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,306 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-02-07 22:06:08,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:06:08,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:06:08,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:06:08,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:06:08,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (1/1) ... [2025-02-07 22:06:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:06:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:06:08,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:06:08,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:06:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:06:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:06:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:06:08,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:06:08,558 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:06:08,560 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:06:09,067 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-07 22:06:09,068 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:06:09,075 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:06:09,075 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:06:09,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:06:09 BoogieIcfgContainer [2025-02-07 22:06:09,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:06:09,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:06:09,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:06:09,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:06:09,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:06:07" (1/3) ... [2025-02-07 22:06:09,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b351fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:06:09, skipping insertion in model container [2025-02-07 22:06:09,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:06:08" (2/3) ... [2025-02-07 22:06:09,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b351fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:06:09, skipping insertion in model container [2025-02-07 22:06:09,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:06:09" (3/3) ... [2025-02-07 22:06:09,085 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-02-07 22:06:09,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:06:09,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:06:09,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:06:09,153 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;@e3159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:06:09,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:06:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:06:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:06:09,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:09,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:06:09,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:09,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:06:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:06:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077903304] [2025-02-07 22:06:09,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:09,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:09,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:06:09,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:06:09,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:06:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:06:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:06:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:09,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:09,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 22:06:09,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:06:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:09,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:06:09,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:06:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077903304] [2025-02-07 22:06:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077903304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:06:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:06:09,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:06:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635771891] [2025-02-07 22:06:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:06:09,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:06:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:06:09,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:06:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:06:09,804 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:06:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:06:09,854 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 22:06:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:06:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 22:06:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:06:09,860 INFO L225 Difference]: With dead ends: 15 [2025-02-07 22:06:09,863 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 22:06:09,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:06:09,867 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:06:09,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:06:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 22:06:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 22:06:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:06:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:06:09,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:06:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:06:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:06:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:06:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:06:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:06:09,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:06:09,893 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:06:09,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:06:10,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:10,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:06:10,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:06:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:06:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:06:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715879121] [2025-02-07 22:06:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:06:10,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:06:10,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:06:10,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:06:10,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:06:10,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:06:10,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:06:10,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:06:10,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:06:10,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-07 22:06:10,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:06:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:06:12,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:06:19,043 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|)) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse18 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|))) (let ((.cse16 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse18))))))) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|)) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse11)))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse17))))) (and (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))))))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))))))) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse0)))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse20))))))) (.cse2 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2)))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))) .cse17))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14))))))) (.cse8 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))) .cse11)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse8))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse4)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse9))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse24))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse23))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse21))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse9)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse18)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse15)))))) .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 (_ bv255 32)))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse29))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse29))) .cse13))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse9)))))))))))) .cse31))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse18))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse28))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse16))))))))) .cse0))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse14))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse33 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse14)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse33 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse32 .cse16))))))))))))))))))))))))))))))) (_ bv1 32)))))))) (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53))))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse56))))))) (.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse0)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse47))))))) (.cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse35)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse16))) .cse17))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse35))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse43 .cse44))))))) (.cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse10))) .cse11)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 .cse41))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse38 .cse39))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse39)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse37)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse51 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse56 .cse42))))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse55))))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse54))))) (let ((.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse52))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 (_ bv254 32)))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse49)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse49)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse42))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse45)))))) .cse51)))))) .cse27)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse52))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse54))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse55))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse56 .cse42)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse18))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse51))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse51))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse16))))))))) .cse0))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse44))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse58 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse44)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse58 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse16)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|)))))))))))))))))))))) (_ bv1 32)))))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (let ((.cse59 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_38~0#1|))) (let ((.cse65 (not .cse59)) (.cse62 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse64 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse61 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse69 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_37~0#1|))) (and (or (and (or .cse59 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse60 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse61))) .cse61))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse60))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse60) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse63 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse61))) .cse61))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse62 (bvashr (bvor .cse63 .cse64) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse63))))))) (or .cse65 (let ((.cse67 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse61))) .cse61))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse66 (bvor .cse67 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse66))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse66) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse68 (bvor .cse67 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse62 (bvashr (bvor .cse68 .cse64) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse68))))))))) (not .cse69)) (or (let ((.cse70 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse73 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse61))) .cse61))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse73 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse73) (_ bv0 32))))))) (.cse71 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse72 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse61))) .cse61))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse62 (bvashr (bvor .cse72 .cse64) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse72) (_ bv0 32))))))) (and (or .cse65 .cse70) (or .cse59 .cse70) (or .cse71 .cse65) (or .cse59 .cse71))) .cse69))))) is different from false [2025-02-07 22:07:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-07 22:07:01,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:07:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715879121] [2025-02-07 22:07:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715879121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:07:01,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:07:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 22:07:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864550291] [2025-02-07 22:07:01,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:07:01,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:07:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:07:01,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:07:01,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=5, NotChecked=18, Total=132 [2025-02-07 22:07:01,684 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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-02-07 22:07:10,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]