./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:43:37,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:43:37,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:43:37,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:43:37,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:43:37,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:43:37,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:43:37,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:43:37,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:43:37,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:43:37,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:43:37,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:43:37,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:43:37,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:43:37,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:43:37,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:43:37,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:43:37,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:37,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:43:37,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:43:37,465 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-03-03 09:43:37,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:43:37,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:43:37,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:43:37,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:43:37,693 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:43:37,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-03 09:43:38,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d2fb96a/d933c24196d945ffb6ed6e58e4ca4896/FLAG893006205 [2025-03-03 09:43:38,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:43:38,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-03 09:43:39,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d2fb96a/d933c24196d945ffb6ed6e58e4ca4896/FLAG893006205 [2025-03-03 09:43:39,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d2fb96a/d933c24196d945ffb6ed6e58e4ca4896 [2025-03-03 09:43:39,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:43:39,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:43:39,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:39,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:43:39,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:43:39,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39, skipping insertion in model container [2025-03-03 09:43:39,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:43:39,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-03 09:43:39,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:39,478 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:43:39,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-03 09:43:39,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:39,499 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:43:39,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39 WrapperNode [2025-03-03 09:43:39,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:39,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:39,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:43:39,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:43:39,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,528 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-03-03 09:43:39,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:39,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:43:39,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:43:39,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:43:39,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:43:39,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:43:39,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:43:39,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:43:39,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:43:39,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (1/1) ... [2025-03-03 09:43:39,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:39,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:43:39,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:43:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:43:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:43:39,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:43:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:43:39,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:43:39,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:43:39,759 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 09:43:39,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:43:39,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:43:39,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:43:39,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:39 BoogieIcfgContainer [2025-03-03 09:43:39,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:43:39,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:43:39,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:43:39,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:43:39,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:39" (1/3) ... [2025-03-03 09:43:39,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be66c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:39, skipping insertion in model container [2025-03-03 09:43:39,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:39" (2/3) ... [2025-03-03 09:43:39,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be66c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:39, skipping insertion in model container [2025-03-03 09:43:39,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:39" (3/3) ... [2025-03-03 09:43:39,775 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-03-03 09:43:39,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:43:39,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:43:39,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:43:39,823 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;@161d2340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:43:39,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:43:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 09:43:39,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:39,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 09:43:39,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 53393351, now seen corresponding path program 1 times [2025-03-03 09:43:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455943298] [2025-03-03 09:43:39,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:39,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 09:43:39,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 09:43:39,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:39,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455943298] [2025-03-03 09:43:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455943298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918398833] [2025-03-03 09:43:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:39,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:39,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:39,995 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:40,024 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-03 09:43:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 09:43:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:40,030 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:43:40,030 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:43:40,032 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-03-03 09:43:40,033 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:40,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:43:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-03 09:43:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-03 09:43:40,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2025-03-03 09:43:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:40,052 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-03 09:43:40,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-03 09:43:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:43:40,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:40,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:40,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:43:40,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:40,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 932261234, now seen corresponding path program 1 times [2025-03-03 09:43:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:40,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373661863] [2025-03-03 09:43:40,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:40,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:43:40,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:43:40,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:40,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373661863] [2025-03-03 09:43:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373661863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506836990] [2025-03-03 09:43:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:40,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:40,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:40,175 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:40,203 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-03-03 09:43:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:43:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:40,204 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:43:40,204 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:43:40,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:40,205 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:40,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:43:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:43:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 09:43:40,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-03-03 09:43:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:40,208 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 09:43:40,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 09:43:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:43:40,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:40,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:43:40,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 933184755, now seen corresponding path program 1 times [2025-03-03 09:43:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364423382] [2025-03-03 09:43:40,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:43:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:43:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:40,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364423382] [2025-03-03 09:43:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364423382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357266705] [2025-03-03 09:43:40,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:40,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:40,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:43:40,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:43:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:43:40,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:40,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:40,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:43:40,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:40,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:40,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357266705] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:40,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:40,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 7] total 14 [2025-03-03 09:43:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865930358] [2025-03-03 09:43:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:40,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:43:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:40,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:43:40,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:43:40,643 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:40,761 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-03 09:43:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:43:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:43:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:40,762 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:43:40,762 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:43:40,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:43:40,763 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:40,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:43:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-03-03 09:43:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-03 09:43:40,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2025-03-03 09:43:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:40,766 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-03 09:43:40,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-03 09:43:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:43:40,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:40,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:40,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:43:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:40,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 792665199, now seen corresponding path program 1 times [2025-03-03 09:43:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-03-03 09:43:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:43:40,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:43:40,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:40,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-03-03 09:43:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872206248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341800767] [2025-03-03 09:43:41,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:41,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:41,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:41,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:43:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:43:41,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:43:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:41,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:43:41,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:41,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341800767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-03 09:43:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928220177] [2025-03-03 09:43:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:41,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:43:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:41,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:43:41,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:43:41,115 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-03-03 09:43:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:41,154 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-03-03 09:43:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:43:41,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Word has length 13 [2025-03-03 09:43:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:41,155 INFO L225 Difference]: With dead ends: 67 [2025-03-03 09:43:41,155 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 09:43:41,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:43:41,155 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:41,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 09:43:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-03 09:43:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-03 09:43:41,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2025-03-03 09:43:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-03 09:43:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-03-03 09:43:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-03 09:43:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:43:41,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:41,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:41,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:41,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:43:41,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:41,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash -81301471, now seen corresponding path program 1 times [2025-03-03 09:43:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:41,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-03 09:43:41,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:41,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:43:41,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:43:41,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:41,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-03 09:43:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87074706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731531454] [2025-03-03 09:43:41,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:41,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:41,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:41,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:41,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:43:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:43:41,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:43:41,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:41,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:43:41,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:41,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731531454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:41,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2025-03-03 09:43:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183603637] [2025-03-03 09:43:41,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:41,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:43:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:41,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:43:41,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:43:41,788 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:42,167 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2025-03-03 09:43:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:43:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 09:43:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:42,168 INFO L225 Difference]: With dead ends: 161 [2025-03-03 09:43:42,168 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:43:42,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:43:42,169 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 203 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:42,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 94 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:43:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:43:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-03-03 09:43:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-03 09:43:42,176 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 20 [2025-03-03 09:43:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:42,176 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-03 09:43:42,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-03 09:43:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:43:42,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:42,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:42,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:42,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:42,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:42,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1861872843, now seen corresponding path program 1 times [2025-03-03 09:43:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139695622] [2025-03-03 09:43:42,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:42,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:43:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:43:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139695622] [2025-03-03 09:43:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139695622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948985199] [2025-03-03 09:43:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:42,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:42,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:42,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:43:42,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:43:42,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:43:42,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:42,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:43:42,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:43:42,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:43:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948985199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:42,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:42,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-03-03 09:43:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745754146] [2025-03-03 09:43:42,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:43:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:42,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:43:42,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:43:42,935 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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-03-03 09:43:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:43,553 INFO L93 Difference]: Finished difference Result 391 states and 515 transitions. [2025-03-03 09:43:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 09:43:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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 29 [2025-03-03 09:43:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:43,555 INFO L225 Difference]: With dead ends: 391 [2025-03-03 09:43:43,555 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 09:43:43,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:43:43,559 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 329 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:43,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 193 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:43:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 09:43:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 230. [2025-03-03 09:43:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.314410480349345) internal successors, (301), 229 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 301 transitions. [2025-03-03 09:43:43,583 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 301 transitions. Word has length 29 [2025-03-03 09:43:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 301 transitions. [2025-03-03 09:43:43,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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-03-03 09:43:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2025-03-03 09:43:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:43:43,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:43,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:43,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:43,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 536388730, now seen corresponding path program 1 times [2025-03-03 09:43:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818465129] [2025-03-03 09:43:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:43,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:43:43,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:43:43,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:43,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:43:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818465129] [2025-03-03 09:43:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818465129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:43:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363471639] [2025-03-03 09:43:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:43,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:43,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:43,894 INFO L87 Difference]: Start difference. First operand 230 states and 301 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:43,917 INFO L93 Difference]: Finished difference Result 444 states and 587 transitions. [2025-03-03 09:43:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 37 [2025-03-03 09:43:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:43,918 INFO L225 Difference]: With dead ends: 444 [2025-03-03 09:43:43,918 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 09:43:43,919 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-03-03 09:43:43,919 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:43,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 09:43:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2025-03-03 09:43:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 233 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 297 transitions. [2025-03-03 09:43:43,930 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 297 transitions. Word has length 37 [2025-03-03 09:43:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 297 transitions. [2025-03-03 09:43:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 297 transitions. [2025-03-03 09:43:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:43:43,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:43,931 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:43:43,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash -16503956, now seen corresponding path program 1 times [2025-03-03 09:43:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:43,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186497982] [2025-03-03 09:43:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:43,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:43:43,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:43:43,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:43,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186497982] [2025-03-03 09:43:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186497982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520446939] [2025-03-03 09:43:44,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:44,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:44,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:43:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:43:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:43:44,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:44,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:44,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:43:44,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:44,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520446939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:44,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:44,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 24 [2025-03-03 09:43:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751651785] [2025-03-03 09:43:44,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:44,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:43:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:44,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:43:44,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:43:44,476 INFO L87 Difference]: Start difference. First operand 234 states and 297 transitions. Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:44,916 INFO L93 Difference]: Finished difference Result 643 states and 837 transitions. [2025-03-03 09:43:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:43:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 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 38 [2025-03-03 09:43:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:44,919 INFO L225 Difference]: With dead ends: 643 [2025-03-03 09:43:44,919 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 09:43:44,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:43:44,920 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 227 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:44,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 310 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:43:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 09:43:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 397. [2025-03-03 09:43:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.2752525252525253) internal successors, (505), 396 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2025-03-03 09:43:44,933 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 38 [2025-03-03 09:43:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2025-03-03 09:43:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2025-03-03 09:43:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:43:44,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:44,934 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:44,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:43:45,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:45,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1570611164, now seen corresponding path program 2 times [2025-03-03 09:43:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:45,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897766364] [2025-03-03 09:43:45,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:45,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-03 09:43:45,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:43:45,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:45,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:43:45,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:43:45,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 09:43:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:43:45,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:45,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:43:45,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:43:45,200 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:43:45,201 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:43:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:43:45,206 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:45,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:43:45,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:43:45 BoogieIcfgContainer [2025-03-03 09:43:45,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:43:45,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:43:45,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:43:45,233 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:43:45,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:39" (3/4) ... [2025-03-03 09:43:45,235 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 09:43:45,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:43:45,236 INFO L158 Benchmark]: Toolchain (without parser) took 5888.44ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 52.6MB in the end (delta: 53.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2025-03-03 09:43:45,236 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:45,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.48ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:45,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.93ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:45,237 INFO L158 Benchmark]: Boogie Preprocessor took 36.80ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:45,237 INFO L158 Benchmark]: IcfgBuilder took 200.25ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 79.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:45,237 INFO L158 Benchmark]: TraceAbstraction took 5462.19ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 52.7MB in the end (delta: 27.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-03-03 09:43:45,237 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 142.6MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:45,238 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.14ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.8MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.48ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.93ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.80ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 200.25ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 79.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5462.19ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 52.7MB in the end (delta: 27.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 142.6MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: 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 shiftLeft at line 31, overapproximation of bitwiseAnd at line 32. Possible FailurePath: [L24] unsigned char x = __VERIFIER_nondet_uchar(); [L25] unsigned char y; [L26] unsigned char c; [L28] y = 0 [L29] c = 0 VAL [c=0, y=0] [L30] COND TRUE c < (unsigned char)8 VAL [c=0, y=0] [L31] EXPR ((unsigned char)1) << c VAL [c=0, y=0] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=0, i=1, x=2, y=0] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=0, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=1, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=1, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=1, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=2, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=2, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=2, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=3, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=3, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=3, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=4, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=4, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=4, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=5, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=5, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=5, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=6, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=6, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=6, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=7, x=2, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=7, x=2, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=7, i=256, x=2, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=7, i=256, x=2, y=1] [L36] c = c + ((unsigned char)1) [L30] COND FALSE !(c < (unsigned char)8) [L38] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 850 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 850 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 629 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 146 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 166 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=8, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 299 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2315 SizeOfPredicates, 16 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 94/304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 09:43:45,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:43:46,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:43:47,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 09:43:47,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:43:47,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:43:47,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:43:47,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:43:47,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:43:47,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:43:47,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:43:47,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:43:47,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:43:47,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:43:47,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:43:47,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:43:47,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:43:47,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:43:47,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 09:43:47,114 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:43:47,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:43:47,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:47,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:43:47,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:43:47,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:43:47,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:43:47,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-03-03 09:43:47,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:43:47,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:43:47,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:43:47,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:43:47,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:43:47,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-03 09:43:48,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889f3956/52e44d32e5824158947afbbb3a84264d/FLAGc639d68b0 [2025-03-03 09:43:48,706 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:43:48,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-03 09:43:48,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889f3956/52e44d32e5824158947afbbb3a84264d/FLAGc639d68b0 [2025-03-03 09:43:48,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889f3956/52e44d32e5824158947afbbb3a84264d [2025-03-03 09:43:48,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:43:48,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:43:48,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:48,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:43:48,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:43:48,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f43c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48, skipping insertion in model container [2025-03-03 09:43:48,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:43:48,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-03 09:43:48,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:48,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:43:48,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-03 09:43:48,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:48,890 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:43:48,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48 WrapperNode [2025-03-03 09:43:48,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:48,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:48,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:43:48,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:43:48,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,910 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-03-03 09:43:48,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:48,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:43:48,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:43:48,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:43:48,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,927 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:43:48,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:43:48,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:43:48,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:43:48,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:43:48,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (1/1) ... [2025-03-03 09:43:48,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:48,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:43:48,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:43:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:43:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:43:48,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:43:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 09:43:49,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:43:49,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:43:49,114 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 09:43:49,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:43:49,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:43:49,121 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:43:49,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:49 BoogieIcfgContainer [2025-03-03 09:43:49,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:43:49,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:43:49,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:43:49,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:43:49,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:48" (1/3) ... [2025-03-03 09:43:49,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48696ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:49, skipping insertion in model container [2025-03-03 09:43:49,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:48" (2/3) ... [2025-03-03 09:43:49,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48696ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:49, skipping insertion in model container [2025-03-03 09:43:49,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:49" (3/3) ... [2025-03-03 09:43:49,127 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-03-03 09:43:49,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:43:49,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:43:49,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:43:49,182 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;@792ce2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:43:49,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:43:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 09:43:49,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:49,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 09:43:49,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash 41953607, now seen corresponding path program 1 times [2025-03-03 09:43:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248814563] [2025-03-03 09:43:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:49,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:49,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:43:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 09:43:49,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 09:43:49,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:49,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:49,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:43:49,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:49,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:49,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248814563] [2025-03-03 09:43:49,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248814563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:49,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936309444] [2025-03-03 09:43:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:49,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:49,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:49,305 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:49,326 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-03-03 09:43:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 09:43:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:49,332 INFO L225 Difference]: With dead ends: 22 [2025-03-03 09:43:49,332 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 09:43:49,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-03 09:43:49,335 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:49,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 09:43:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-03-03 09:43:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-03 09:43:49,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-03-03 09:43:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-03 09:43:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-03-03 09:43:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 09:43:49,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:49,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:49,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:43:49,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:49,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 122760732, now seen corresponding path program 1 times [2025-03-03 09:43:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968970914] [2025-03-03 09:43:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:49,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:49,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:49,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:49,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:43:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 09:43:49,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 09:43:49,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:49,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:43:49,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:49,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:49,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968970914] [2025-03-03 09:43:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968970914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:49,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2025-03-03 09:43:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306047594] [2025-03-03 09:43:49,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:49,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:43:49,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:49,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:43:49,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:43:49,682 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-03-03 09:43:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:49,716 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-03-03 09:43:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:43:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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) Word has length 8 [2025-03-03 09:43:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:49,716 INFO L225 Difference]: With dead ends: 21 [2025-03-03 09:43:49,716 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:43:49,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:43:49,717 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:49,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:43:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 09:43:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 09:43:49,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-03-03 09:43:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:49,723 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 09:43:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-03-03 09:43:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 09:43:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:43:49,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:49,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-03 09:43:49,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:43:49,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:49,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -993105657, now seen corresponding path program 2 times [2025-03-03 09:43:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821183447] [2025-03-03 09:43:49,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:49,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:49,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:43:49,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:43:49,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:43:49,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:49,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:43:49,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:50,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:50,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821183447] [2025-03-03 09:43:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821183447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:50,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:50,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-03-03 09:43:50,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809123516] [2025-03-03 09:43:50,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:50,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:43:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:50,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:43:50,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:43:50,215 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:50,379 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-03-03 09:43:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:43:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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 17 [2025-03-03 09:43:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:50,380 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:43:50,381 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 09:43:50,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:43:50,383 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:50,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 85 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 09:43:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 09:43:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-03-03 09:43:50,391 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 17 [2025-03-03 09:43:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:50,391 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-03 09:43:50,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-03-03 09:43:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:43:50,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:50,392 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-03-03 09:43:50,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:43:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:50,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1560606521, now seen corresponding path program 3 times [2025-03-03 09:43:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502167306] [2025-03-03 09:43:50,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:43:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:50,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:50,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:43:50,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 9 equivalence classes. [2025-03-03 09:43:50,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:43:50,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:43:50,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:50,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 09:43:50,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:51,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:44:14,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502167306] [2025-03-03 09:44:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502167306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:14,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:14,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2025-03-03 09:44:14,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917891447] [2025-03-03 09:44:14,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 09:44:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 09:44:14,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=2161, Unknown=3, NotChecked=0, Total=2862 [2025-03-03 09:44:14,049 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:26,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse39))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse39)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse26)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse26)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse26)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse37)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse30))))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse22)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse38)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse35)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse41)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse42))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse19 (bvslt .cse52 (_ bv8 32))) (.cse21 (bvslt .cse51 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse20)))) (.cse8 (= .cse50 .cse2)) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse12))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse25)))) (.cse14 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse44))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse11)))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))) (_ bv0 32))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))) (_ bv0 32))) (.cse40 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse16 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse18 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse12))) .cse2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse19 (= .cse2 .cse20) .cse15 .cse16 .cse7 .cse18) (or .cse21 .cse16 (= .cse2 .cse22) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse24))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse11)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse24))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse12))) .cse24) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse19 .cse0 .cse15 .cse16 (= .cse32 .cse2) .cse7 .cse18) (or .cse33 (= .cse34 .cse2) .cse5 .cse13 .cse15 .cse16 .cse7 .cse18) (or .cse19 .cse5 (= .cse2 .cse35) .cse15 .cse16 .cse7 .cse18) (or .cse4 (= .cse2 .cse36) .cse7) (or .cse21 .cse5 (= .cse2 .cse37) .cse16 .cse7) (or .cse21 .cse0 (= .cse2 .cse38) .cse16 .cse7) (or (= .cse2 .cse10) .cse33 .cse13 .cse15 .cse16 .cse7 .cse18) (or (bvslt .cse39 (_ bv8 32)) .cse8) (or .cse40 .cse0 .cse16 (= .cse2 .cse41) .cse7 .cse18) (or .cse40 .cse16 (= .cse2 .cse42) .cse7 .cse18) (or .cse33 .cse0 .cse13 (= .cse2 .cse43) .cse15 .cse16 .cse7 .cse18) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse11))))))) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse5 (= .cse29 .cse2) .cse13 .cse15 (bvslt .cse44 (_ bv8 32)) .cse16 .cse17 .cse7 .cse18) (or .cse40 (= .cse45 .cse2) .cse5 .cse16 .cse7 .cse18) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-03-03 09:44:39,049 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 09:44:55,333 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 09:45:05,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse41))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse25)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 .cse30))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse39)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse43)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse44)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19))) .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24))) .cse26)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse42 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse34 (_ bv8 32)) (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse37) .cse7) (or .cse20 .cse5 (= .cse2 .cse38) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse39) .cse15 .cse7) (or .cse0 (= .cse2 .cse40) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse41 (_ bv8 32)) .cse8) (or .cse42 .cse0 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse42 .cse15 (= .cse2 .cse44) .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse40)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse42 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-03-03 09:45:17,246 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)