/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/interleave_bits.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-10-31 19:31:17,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 19:31:17,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 19:31:17,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 19:31:17,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 19:31:17,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 19:31:17,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 19:31:17,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 19:31:17,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 19:31:17,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 19:31:17,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 19:31:17,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 19:31:17,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 19:31:17,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 19:31:17,444 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 19:31:17,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 19:31:17,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 19:31:17,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 19:31:17,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 19:31:17,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 19:31:17,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 19:31:17,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 19:31:17,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 19:31:17,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 19:31:17,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 19:31:17,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 19:31:17,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 19:31:17,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 19:31:17,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 19:31:17,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 19:31:17,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 19:31:17,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 19:31:17,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 19:31:17,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 19:31:17,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 19:31:17,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 19:31:17,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 19:31:17,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 19:31:17,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 19:31:17,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:17,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 19:31:17,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 19:31:17,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 19:31:17,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 19:31:17,454 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 19:31:17,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:17,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 19:31:17,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 19:31:17,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 19:31:17,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 19:31:17,748 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 19:31:17,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/interleave_bits.i [2024-10-31 19:31:18,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 19:31:19,187 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 19:31:19,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i [2024-10-31 19:31:19,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedfd0179/2015adabd3704f0b8321fd153c676a78/FLAG97e6bd5e7 [2024-10-31 19:31:19,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedfd0179/2015adabd3704f0b8321fd153c676a78 [2024-10-31 19:31:19,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 19:31:19,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-31 19:31:19,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 19:31:19,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 19:31:19,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 19:31:19,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b89547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19, skipping insertion in model container [2024-10-31 19:31:19,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 19:31:19,721 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2024-10-31 19:31:19,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 19:31:19,754 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 19:31:19,763 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2024-10-31 19:31:19,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 19:31:19,789 INFO L204 MainTranslator]: Completed translation [2024-10-31 19:31:19,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19 WrapperNode [2024-10-31 19:31:19,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 19:31:19,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 19:31:19,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 19:31:19,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 19:31:19,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,821 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-10-31 19:31:19,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 19:31:19,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 19:31:19,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 19:31:19,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 19:31:19,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,842 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]. [2024-10-31 19:31:19,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 19:31:19,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 19:31:19,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 19:31:19,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 19:31:19,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (1/1) ... [2024-10-31 19:31:19,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 19:31:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-31 19:31:19,893 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) [2024-10-31 19:31:19,899 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 [2024-10-31 19:31:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 19:31:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 19:31:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 19:31:19,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 19:31:19,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 19:31:19,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 19:31:20,085 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-31 19:31:20,086 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 19:31:20,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 19:31:20,100 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 19:31:20,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 07:31:20 BoogieIcfgContainer [2024-10-31 19:31:20,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 19:31:20,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 19:31:20,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 19:31:20,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 19:31:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 07:31:19" (1/3) ... [2024-10-31 19:31:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c09cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 07:31:20, skipping insertion in model container [2024-10-31 19:31:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 07:31:19" (2/3) ... [2024-10-31 19:31:20,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c09cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 07:31:20, skipping insertion in model container [2024-10-31 19:31:20,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 07:31:20" (3/3) ... [2024-10-31 19:31:20,107 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2024-10-31 19:31:20,118 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 19:31:20,118 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 19:31:20,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 19:31:20,164 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;@83c4cb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 19:31:20,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 19:31:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) [2024-10-31 19:31:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 19:31:20,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 19:31:20,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 19:31:20,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 19:31:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 19:31:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2024-10-31 19:31:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 19:31:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845257395] [2024-10-31 19:31:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 19:31:20,183 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-31 19:31:20,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 19:31:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-10-31 19:31:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 19:31:20,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 19:31:20,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 19:31:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:20,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 19:31:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:20,306 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 19:31:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845257395] [2024-10-31 19:31:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [845257395] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 19:31:20,306 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 19:31:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 19:31:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725030279] [2024-10-31 19:31:20,308 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 19:31:20,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 19:31:20,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 19:31:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 19:31:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 19:31:20,329 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 19:31:20,353 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-10-31 19:31:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 19:31:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-31 19:31:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 19:31:20,360 INFO L225 Difference]: With dead ends: 21 [2024-10-31 19:31:20,360 INFO L226 Difference]: Without dead ends: 9 [2024-10-31 19:31:20,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 19:31:20,364 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 19:31:20,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 19:31:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-31 19:31:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-31 19:31:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-31 19:31:20,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-10-31 19:31:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 19:31:20,383 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-31 19:31:20,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-31 19:31:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 19:31:20,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 19:31:20,383 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-31 19:31:20,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-10-31 19:31:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:20,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 19:31:20,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 19:31:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times [2024-10-31 19:31:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 19:31:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142779912] [2024-10-31 19:31:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 19:31:20,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-31 19:31:20,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 19:31:20,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-31 19:31:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 19:31:20,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 19:31:20,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 19:31:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:20,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 19:31:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:20,740 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 19:31:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142779912] [2024-10-31 19:31:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [142779912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 19:31:20,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 19:31:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-31 19:31:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900406491] [2024-10-31 19:31:20,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 19:31:20,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 19:31:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 19:31:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 19:31:20,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 19:31:20,743 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2024-10-31 19:31:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 19:31:20,795 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-31 19:31:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 19:31:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 8 [2024-10-31 19:31:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 19:31:20,796 INFO L225 Difference]: With dead ends: 17 [2024-10-31 19:31:20,796 INFO L226 Difference]: Without dead ends: 13 [2024-10-31 19:31:20,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-31 19:31:20,798 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 19:31:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 19:31:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-31 19:31:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-31 19:31:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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) [2024-10-31 19:31:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-31 19:31:20,804 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2024-10-31 19:31:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 19:31:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-31 19:31:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2024-10-31 19:31:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-31 19:31:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 19:31:20,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 19:31:20,805 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2024-10-31 19:31:20,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-10-31 19:31:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:21,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 19:31:21,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 19:31:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 2 times [2024-10-31 19:31:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 19:31:21,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818871788] [2024-10-31 19:31:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 19:31:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-31 19:31:21,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 19:31:21,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-31 19:31:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 19:31:21,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-31 19:31:21,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 19:31:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:21,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 19:31:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:21,279 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 19:31:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818871788] [2024-10-31 19:31:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1818871788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 19:31:21,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 19:31:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-31 19:31:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069506122] [2024-10-31 19:31:21,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 19:31:21,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 19:31:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 19:31:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 19:31:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-31 19:31:21,283 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2024-10-31 19:31:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 19:31:21,489 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-31 19:31:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 19:31:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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 12 [2024-10-31 19:31:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 19:31:21,490 INFO L225 Difference]: With dead ends: 25 [2024-10-31 19:31:21,490 INFO L226 Difference]: Without dead ends: 21 [2024-10-31 19:31:21,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-10-31 19:31:21,491 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 19:31:21,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 19:31:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-31 19:31:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-31 19:31:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 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) [2024-10-31 19:31:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-10-31 19:31:21,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2024-10-31 19:31:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 19:31:21,496 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-10-31 19:31:21,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2024-10-31 19:31:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-10-31 19:31:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 19:31:21,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 19:31:21,497 INFO L215 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2024-10-31 19:31:21,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-31 19:31:21,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:21,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 19:31:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 19:31:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2078182539, now seen corresponding path program 3 times [2024-10-31 19:31:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 19:31:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646574612] [2024-10-31 19:31:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 19:31:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-31 19:31:21,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 19:31:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-31 19:31:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 19:31:21,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 19:31:21,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 19:31:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:22,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 19:31:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:22,442 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 19:31:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646574612] [2024-10-31 19:31:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1646574612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 19:31:22,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 19:31:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-10-31 19:31:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204570104] [2024-10-31 19:31:22,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 19:31:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-31 19:31:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 19:31:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-31 19:31:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2024-10-31 19:31:22,445 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 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) [2024-10-31 19:31:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 19:31:22,607 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-31 19:31:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-31 19:31:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 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) Word has length 20 [2024-10-31 19:31:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 19:31:22,608 INFO L225 Difference]: With dead ends: 27 [2024-10-31 19:31:22,608 INFO L226 Difference]: Without dead ends: 23 [2024-10-31 19:31:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2024-10-31 19:31:22,610 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 19:31:22,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 19:31:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-31 19:31:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-31 19:31:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 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) [2024-10-31 19:31:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-31 19:31:22,615 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2024-10-31 19:31:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 19:31:22,615 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-31 19:31:22,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 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) [2024-10-31 19:31:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-31 19:31:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 19:31:22,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 19:31:22,616 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2024-10-31 19:31:22,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-31 19:31:22,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:22,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 19:31:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 19:31:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2024-10-31 19:31:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 19:31:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891639503] [2024-10-31 19:31:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 19:31:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-31 19:31:22,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 19:31:22,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-31 19:31:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 19:31:22,963 WARN L253 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-31 19:31:22,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 19:31:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:24,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 19:31:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 19:31:51,561 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 19:31:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891639503] [2024-10-31 19:31:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1891639503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 19:31:51,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 19:31:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2024-10-31 19:31:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569713691] [2024-10-31 19:31:51,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 19:31:51,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-31 19:31:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 19:31:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-31 19:31:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2024-10-31 19:31:51,563 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 19:31:52,206 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-10-31 19:31:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-31 19:31:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 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 22 [2024-10-31 19:31:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 19:31:52,212 INFO L225 Difference]: With dead ends: 23 [2024-10-31 19:31:52,212 INFO L226 Difference]: Without dead ends: 0 [2024-10-31 19:31:52,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2024-10-31 19:31:52,213 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 19:31:52,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 19:31:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-31 19:31:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-31 19:31:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-31 19:31:52,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-10-31 19:31:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 19:31:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 19:31:52,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 19:31:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-31 19:31:52,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-31 19:31:52,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 19:31:52,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-31 19:31:52,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-31 19:31:52,421 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-10-31 19:31:52,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-31 19:31:52,665 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 19:31:52,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 07:31:52 BoogieIcfgContainer [2024-10-31 19:31:52,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 19:31:52,695 INFO L158 Benchmark]: Toolchain (without parser) took 33135.37ms. Allocated memory was 232.8MB in the beginning and 306.2MB in the end (delta: 73.4MB). Free memory was 207.6MB in the beginning and 205.0MB in the end (delta: 2.6MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,695 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory was 208.4MB in the beginning and 208.3MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-10-31 19:31:52,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.39ms. Allocated memory is still 232.8MB. Free memory was 207.1MB in the beginning and 194.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 232.8MB. Free memory was 194.0MB in the beginning and 192.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,696 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 232.8MB. Free memory was 192.9MB in the beginning and 190.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,696 INFO L158 Benchmark]: RCFGBuilder took 244.71ms. Allocated memory is still 232.8MB. Free memory was 190.9MB in the beginning and 179.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,696 INFO L158 Benchmark]: TraceAbstraction took 32593.13ms. Allocated memory was 232.8MB in the beginning and 306.2MB in the end (delta: 73.4MB). Free memory was 178.8MB in the beginning and 205.0MB in the end (delta: -26.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2024-10-31 19:31:52,697 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.09ms. Allocated memory is still 232.8MB. Free memory was 208.4MB in the beginning and 208.3MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.39ms. Allocated memory is still 232.8MB. Free memory was 207.1MB in the beginning and 194.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 232.8MB. Free memory was 194.0MB in the beginning and 192.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 232.8MB. Free memory was 192.9MB in the beginning and 190.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.71ms. Allocated memory is still 232.8MB. Free memory was 190.9MB in the beginning and 179.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32593.13ms. Allocated memory was 232.8MB in the beginning and 306.2MB in the end (delta: 73.4MB). Free memory was 178.8MB in the beginning and 205.0MB in the end (delta: -26.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 25]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 31 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 28.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 9385 SizeOfPredicates, 2 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 120/530 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((i == 9) && (z == (((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))))) || ((z == ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) && (i == 7))) || ((((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) == z) && (i == 2))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || ((i == 8) && (z == ((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))))) || ((i == 10) && (z == ((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9)))))) || (z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))))) || ((i == 6) && (z == ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))) || ((z == (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) && (i == 11))) || ((z == (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))) && (i == 5))) || ((z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11))))) && (i == 12))) || ((z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) && (i == 14))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))) && (i == 15))) || ((i == 0) && (z == 0))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2))))) && (i == 4))) || ((i == 3) && (z == (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))))) RESULT: Ultimate proved your program to be correct! [2024-10-31 19:31:52,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...