/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 Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/gcd_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-10-31 15:02:51,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 15:02:51,757 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 15:02:51,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 15:02:51,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 15:02:51,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 15:02:51,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 15:02:51,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 15:02:51,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 15:02:51,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 15:02:51,813 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 15:02:51,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 15:02:51,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 15:02:51,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 15:02:51,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 15:02:51,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 15:02:51,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 15:02:51,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 15:02:51,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 15:02:51,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 15:02:51,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 15:02:51,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 15:02:51,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 15:02:51,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 15:02:51,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 15:02:51,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 15:02:51,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 15:02:51,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 15:02:51,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 15:02:51,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 15:02:51,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:02:51,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 15:02:51,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 15:02:51,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 15:02:51,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 15:02:51,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 15:02:51,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 15:02:51,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 15:02:51,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 15:02:51,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 15:02:51,823 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 15:02:51,824 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 -> Internal_SMTInterpol [2024-10-31 15:02:52,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 15:02:52,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 15:02:52,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 15:02:52,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 15:02:52,171 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 15:02:52,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_4.c [2024-10-31 15:02:53,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 15:02:53,751 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 15:02:53,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2024-10-31 15:02:53,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1beb63a/6fdcf77bf7e0448b808049e4bd4dc6d4/FLAGcc17aada1 [2024-10-31 15:02:53,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1beb63a/6fdcf77bf7e0448b808049e4bd4dc6d4 [2024-10-31 15:02:53,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 15:02:53,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-31 15:02:53,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 15:02:53,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 15:02:53,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 15:02:53,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:02:53" (1/1) ... [2024-10-31 15:02:53,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a04c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:53, skipping insertion in model container [2024-10-31 15:02:53,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 03:02:53" (1/1) ... [2024-10-31 15:02:53,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 15:02:53,972 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/gcd_4.c[662,675] [2024-10-31 15:02:53,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:02:53,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 15:02:54,015 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/gcd_4.c[662,675] [2024-10-31 15:02:54,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 15:02:54,042 INFO L204 MainTranslator]: Completed translation [2024-10-31 15:02:54,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54 WrapperNode [2024-10-31 15:02:54,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 15:02:54,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 15:02:54,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 15:02:54,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 15:02:54,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,076 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-10-31 15:02:54,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 15:02:54,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 15:02:54,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 15:02:54,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 15:02:54,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,110 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-31 15:02:54,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 15:02:54,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 15:02:54,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 15:02:54,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 15:02:54,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (1/1) ... [2024-10-31 15:02:54,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 15:02:54,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-31 15:02:54,163 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 15:02:54,169 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 15:02:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 15:02:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 15:02:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 15:02:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 15:02:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 15:02:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-31 15:02:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-31 15:02:54,270 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 15:02:54,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 15:02:54,434 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-31 15:02:54,434 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 15:02:54,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 15:02:54,447 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 15:02:54,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:02:54 BoogieIcfgContainer [2024-10-31 15:02:54,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 15:02:54,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 15:02:54,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 15:02:54,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 15:02:54,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 03:02:53" (1/3) ... [2024-10-31 15:02:54,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca3c24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:02:54, skipping insertion in model container [2024-10-31 15:02:54,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 03:02:54" (2/3) ... [2024-10-31 15:02:54,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca3c24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 03:02:54, skipping insertion in model container [2024-10-31 15:02:54,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 03:02:54" (3/3) ... [2024-10-31 15:02:54,459 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2024-10-31 15:02:54,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 15:02:54,477 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 15:02:54,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 15:02:54,547 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;@5a44ea38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 15:02:54,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 15:02:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-31 15:02:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 15:02:54,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:54,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:54,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 705271831, now seen corresponding path program 1 times [2024-10-31 15:02:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1353228334] [2024-10-31 15:02:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:54,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:54,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:02:54,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:54,910 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 15:02:54,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:54,928 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 15:02:54,929 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1353228334] [2024-10-31 15:02:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1353228334] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:54,930 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:02:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94502606] [2024-10-31 15:02:54,933 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:02:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:54,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:02:54,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:02:54,957 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:55,027 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2024-10-31 15:02:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:02:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-31 15:02:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:55,036 INFO L225 Difference]: With dead ends: 44 [2024-10-31 15:02:55,037 INFO L226 Difference]: Without dead ends: 21 [2024-10-31 15:02:55,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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 15:02:55,043 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 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 [2024-10-31 15:02:55,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:02:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-31 15:02:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-31 15:02:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 15:02:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-31 15:02:55,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-10-31 15:02:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-31 15:02:55,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-31 15:02:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 15:02:55,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:55,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:55,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 15:02:55,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2105475655, now seen corresponding path program 1 times [2024-10-31 15:02:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959215408] [2024-10-31 15:02:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:55,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 15:02:55,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:55,241 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 15:02:55,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:55,261 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 15:02:55,262 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:55,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959215408] [2024-10-31 15:02:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1959215408] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:55,264 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-10-31 15:02:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954156541] [2024-10-31 15:02:55,265 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:55,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 15:02:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:55,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 15:02:55,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 15:02:55,267 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:55,299 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-31 15:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 15:02:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:02:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:55,302 INFO L225 Difference]: With dead ends: 34 [2024-10-31 15:02:55,302 INFO L226 Difference]: Without dead ends: 20 [2024-10-31 15:02:55,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 15:02:55,305 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:55,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:02:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-31 15:02:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-31 15:02:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 15:02:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-31 15:02:55,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2024-10-31 15:02:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:55,317 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-31 15:02:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-31 15:02:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 15:02:55,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:55,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 15:02:55,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:55,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1540999076, now seen corresponding path program 1 times [2024-10-31 15:02:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359850817] [2024-10-31 15:02:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:55,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 15:02:55,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:55,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:55,623 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359850817] [2024-10-31 15:02:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [359850817] provided 2 perfect and 0 imperfect interpolant sequences [2024-10-31 15:02:55,623 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-10-31 15:02:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 6 [2024-10-31 15:02:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626754086] [2024-10-31 15:02:55,624 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-10-31 15:02:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 15:02:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:55,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 15:02:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 15:02:55,626 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:55,663 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-31 15:02:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 15:02:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 15:02:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:55,665 INFO L225 Difference]: With dead ends: 37 [2024-10-31 15:02:55,665 INFO L226 Difference]: Without dead ends: 24 [2024-10-31 15:02:55,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 15:02:55,667 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:55,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 15:02:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-31 15:02:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-31 15:02:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 15:02:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-31 15:02:55,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2024-10-31 15:02:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:55,678 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-31 15:02:55,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-31 15:02:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 15:02:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:55,679 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 15:02:55,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 241293598, now seen corresponding path program 1 times [2024-10-31 15:02:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191245473] [2024-10-31 15:02:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:55,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 15:02:55,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:55,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:56,201 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191245473] [2024-10-31 15:02:56,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1191245473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:02:56,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:02:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2024-10-31 15:02:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928119371] [2024-10-31 15:02:56,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:02:56,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 15:02:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 15:02:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-31 15:02:56,207 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:56,384 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-10-31 15:02:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 15:02:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-31 15:02:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:56,387 INFO L225 Difference]: With dead ends: 47 [2024-10-31 15:02:56,387 INFO L226 Difference]: Without dead ends: 34 [2024-10-31 15:02:56,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-31 15:02:56,389 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:56,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:02:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-31 15:02:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-31 15:02:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 15:02:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-31 15:02:56,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2024-10-31 15:02:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:56,402 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-31 15:02:56,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-31 15:02:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 15:02:56,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:56,403 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 15:02:56,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:56,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash 755367163, now seen corresponding path program 2 times [2024-10-31 15:02:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488533018] [2024-10-31 15:02:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 15:02:56,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 15:02:56,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 15:02:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:56,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 15:02:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 15:02:56,893 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-10-31 15:02:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488533018] [2024-10-31 15:02:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1488533018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 15:02:56,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-31 15:02:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-31 15:02:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432546596] [2024-10-31 15:02:56,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-31 15:02:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 15:02:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-10-31 15:02:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 15:02:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-31 15:02:56,896 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 15:02:57,264 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2024-10-31 15:02:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 15:02:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:02:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 15:02:57,267 INFO L225 Difference]: With dead ends: 63 [2024-10-31 15:02:57,267 INFO L226 Difference]: Without dead ends: 44 [2024-10-31 15:02:57,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2024-10-31 15:02:57,268 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 15:02:57,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 15:02:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-31 15:02:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-31 15:02:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 15:02:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2024-10-31 15:02:57,284 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2024-10-31 15:02:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 15:02:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2024-10-31 15:02:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 15:02:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2024-10-31 15:02:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 15:02:57,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 15:02:57,287 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 15:02:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 15:02:57,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 15:02:57,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 15:02:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 465797078, now seen corresponding path program 3 times [2024-10-31 15:02:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-10-31 15:02:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501465332] [2024-10-31 15:02:57,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 15:02:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 15:02:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 15:02:57,514 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-10-31 15:02:57,514 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-10-31 15:02:57,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 15:02:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 15:02:57,525 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-10-31 15:02:57,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 15:02:57,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 03:02:57 BoogieIcfgContainer [2024-10-31 15:02:57,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 15:02:57,546 INFO L158 Benchmark]: Toolchain (without parser) took 3773.99ms. Allocated memory was 212.9MB in the beginning and 320.9MB in the end (delta: 108.0MB). Free memory was 176.3MB in the beginning and 269.5MB in the end (delta: -93.2MB). Peak memory consumption was 129.1MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,546 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-10-31 15:02:57,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.93ms. Allocated memory is still 212.9MB. Free memory was 175.8MB in the beginning and 163.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.81ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,546 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 212.9MB. Free memory was 161.6MB in the beginning and 159.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,547 INFO L158 Benchmark]: RCFGBuilder took 314.36ms. Allocated memory is still 212.9MB. Free memory was 159.5MB in the beginning and 148.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,547 INFO L158 Benchmark]: TraceAbstraction took 3093.73ms. Allocated memory was 212.9MB in the beginning and 320.9MB in the end (delta: 108.0MB). Free memory was 147.4MB in the beginning and 269.5MB in the end (delta: -122.1MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2024-10-31 15:02:57,550 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.10ms. Allocated memory is still 212.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.93ms. Allocated memory is still 212.9MB. Free memory was 175.8MB in the beginning and 163.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.81ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 212.9MB. Free memory was 161.6MB in the beginning and 159.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 314.36ms. Allocated memory is still 212.9MB. Free memory was 159.5MB in the beginning and 148.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3093.73ms. Allocated memory was 212.9MB in the beginning and 320.9MB in the end (delta: 108.0MB). Free memory was 147.4MB in the beginning and 269.5MB in the end (delta: -122.1MB). Peak memory consumption was 100.8MB. 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 - 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L42] long x; [L43] long y; [L44] long g; [L46] x = 63 [L47] y = 18 [L49] CALL, EXPR gcd_test(x, y) [L22] COND FALSE !(a < 0) [L23] COND FALSE !(b < 0) [L25] COND FALSE !(a == 0) [L29] COND TRUE b != 0 [L30] COND TRUE a > b [L31] a = a - b [L29] COND TRUE b != 0 [L30] COND TRUE a > b [L31] a = a - b [L29] COND TRUE b != 0 [L30] COND TRUE a > b [L31] a = a - b [L29] COND TRUE b != 0 [L30] COND FALSE !(a > b) [L33] b = b - a [L29] COND TRUE b != 0 [L30] COND FALSE !(a > b) [L33] b = b - a [L29] COND FALSE !(b != 0) [L36] return a; [L49] RET, EXPR gcd_test(x, y) [L49] g = gcd_test(x, y) [L51] CALL __VERIFIER_assert(x % g == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 219 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 83 mSDtfsCounter, 219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 510 SizeOfPredicates, 10 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 8/52 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 15:02:57,578 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...