/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.brp2.5.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 04:28:35,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 04:28:35,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-26 04:28:35,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 04:28:35,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 04:28:35,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 04:28:35,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 04:28:35,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 04:28:35,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 04:28:35,151 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 04:28:35,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 04:28:35,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 04:28:35,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 04:28:35,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 04:28:35,153 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 04:28:35,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 04:28:35,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 04:28:35,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 04:28:35,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 04:28:35,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 04:28:35,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 04:28:35,155 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 04:28:35,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 04:28:35,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 04:28:35,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 04:28:35,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 04:28:35,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 04:28:35,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 04:28:35,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 04:28:35,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 04:28:35,159 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 04:28:35,159 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 [2023-12-26 04:28:35,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 04:28:35,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 04:28:35,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 04:28:35,367 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 04:28:35,368 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 04:28:35,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.brp2.5.prop1-func-interl.c [2023-12-26 04:28:36,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 04:28:36,777 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 04:28:36,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.brp2.5.prop1-func-interl.c [2023-12-26 04:28:36,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f84b3052/4f2b1b43d3d1484d9d79adf9e5fe47f2/FLAG617ece43e [2023-12-26 04:28:36,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f84b3052/4f2b1b43d3d1484d9d79adf9e5fe47f2 [2023-12-26 04:28:36,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 04:28:36,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 04:28:36,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 04:28:36,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 04:28:36,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 04:28:36,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 04:28:36" (1/1) ... [2023-12-26 04:28:36,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5165486c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:36, skipping insertion in model container [2023-12-26 04:28:36,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 04:28:36" (1/1) ... [2023-12-26 04:28:36,957 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 04:28:37,242 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.brp2.5.prop1-func-interl.c[1171,1184] [2023-12-26 04:28:37,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 04:28:37,756 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 04:28:37,764 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.brp2.5.prop1-func-interl.c[1171,1184] [2023-12-26 04:28:37,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 04:28:37,895 INFO L206 MainTranslator]: Completed translation [2023-12-26 04:28:37,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37 WrapperNode [2023-12-26 04:28:37,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 04:28:37,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 04:28:37,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 04:28:37,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 04:28:37,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:37,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,085 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2655 [2023-12-26 04:28:38,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 04:28:38,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 04:28:38,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 04:28:38,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 04:28:38,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,156 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]. [2023-12-26 04:28:38,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 04:28:38,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 04:28:38,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 04:28:38,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 04:28:38,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (1/1) ... [2023-12-26 04:28:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 04:28:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 04:28:38,333 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) [2023-12-26 04:28:38,392 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 [2023-12-26 04:28:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 04:28:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 04:28:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 04:28:38,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 04:28:38,760 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 04:28:38,762 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 04:28:42,443 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 04:28:42,523 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 04:28:42,523 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 04:28:42,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 04:28:42 BoogieIcfgContainer [2023-12-26 04:28:42,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 04:28:42,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 04:28:42,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 04:28:42,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 04:28:42,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 04:28:36" (1/3) ... [2023-12-26 04:28:42,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a4e1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 04:28:42, skipping insertion in model container [2023-12-26 04:28:42,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:28:37" (2/3) ... [2023-12-26 04:28:42,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a4e1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 04:28:42, skipping insertion in model container [2023-12-26 04:28:42,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 04:28:42" (3/3) ... [2023-12-26 04:28:42,530 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.brp2.5.prop1-func-interl.c [2023-12-26 04:28:42,542 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 04:28:42,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 04:28:42,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 04:28:42,603 INFO L357 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, mHoare=true, 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;@62f4f339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 04:28:42,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 04:28:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 04:28:42,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 04:28:42,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 04:28:42,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 04:28:42,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 04:28:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 04:28:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 04:28:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316915671] [2023-12-26 04:28:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 04:28:42,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:28:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 04:28:42,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 04:28:42,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-26 04:28:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 04:28:43,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-26 04:28:43,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 04:28:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:28:43,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 04:28:43,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 04:28:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316915671] [2023-12-26 04:28:43,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316915671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 04:28:43,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 04:28:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 04:28:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657133953] [2023-12-26 04:28:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 04:28:43,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 04:28:43,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 04:28:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 04:28:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 04:28:43,237 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:44,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-26 04:28:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 04:28:44,743 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 04:28:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 04:28:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-26 04:28:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 04:28:44,750 INFO L225 Difference]: With dead ends: 16 [2023-12-26 04:28:44,750 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 04:28:44,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-26 04:28:44,755 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-26 04:28:44,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-26 04:28:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 04:28:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 04:28:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 04:28:44,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 04:28:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 04:28:44,776 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 04:28:44,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 04:28:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 04:28:44,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 04:28:44,777 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 04:28:44,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-26 04:28:44,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:28:44,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 04:28:44,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 04:28:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 04:28:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 04:28:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479442309] [2023-12-26 04:28:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 04:28:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:28:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 04:28:44,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 04:28:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-26 04:28:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 04:28:48,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-26 04:28:48,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 04:28:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:28:48,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 04:28:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:28:49,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 04:28:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479442309] [2023-12-26 04:28:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479442309] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 04:28:49,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 04:28:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-26 04:28:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051825425] [2023-12-26 04:28:49,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 04:28:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-26 04:28:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 04:28:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-26 04:28:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-26 04:28:49,220 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 04:28:50,732 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 04:28:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 04:28:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-26 04:28:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 04:28:50,733 INFO L225 Difference]: With dead ends: 14 [2023-12-26 04:28:50,733 INFO L226 Difference]: Without dead ends: 12 [2023-12-26 04:28:50,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-26 04:28:50,735 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-26 04:28:50,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-26 04:28:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-26 04:28:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-26 04:28:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-26 04:28:50,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-26 04:28:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 04:28:50,738 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-26 04:28:50,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:28:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-26 04:28:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-26 04:28:50,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 04:28:50,739 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-26 04:28:50,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-26 04:28:50,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:28:50,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 04:28:50,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 04:28:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-26 04:28:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 04:28:50,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24063578] [2023-12-26 04:28:50,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 04:28:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:28:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 04:28:50,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 04:28:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-26 04:28:58,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 04:28:58,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 04:28:58,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 4260 conjuncts, 188 conjunts are in the unsatisfiable core [2023-12-26 04:28:58,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 04:29:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:29:00,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 04:29:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:29:02,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 04:29:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24063578] [2023-12-26 04:29:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24063578] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 04:29:02,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 04:29:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 04:29:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122771480] [2023-12-26 04:29:02,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 04:29:02,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 04:29:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 04:29:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 04:29:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-26 04:29:02,498 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-26 04:29:09,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 04:29:15,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 04:29:20,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 04:29:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 04:29:21,734 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-12-26 04:29:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-26 04:29:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2023-12-26 04:29:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 04:29:21,747 INFO L225 Difference]: With dead ends: 17 [2023-12-26 04:29:21,748 INFO L226 Difference]: Without dead ends: 15 [2023-12-26 04:29:21,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=62, Invalid=118, Unknown=2, NotChecked=0, Total=182 [2023-12-26 04:29:21,750 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-26 04:29:21,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2023-12-26 04:29:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-26 04:29:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-26 04:29:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 04:29:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-26 04:29:21,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2023-12-26 04:29:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 04:29:21,755 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-26 04:29:21,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-26 04:29:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-26 04:29:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-26 04:29:21,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 04:29:21,755 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-26 04:29:21,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-26 04:29:21,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:29:21,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 04:29:21,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 04:29:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 3 times [2023-12-26 04:29:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 04:29:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29936588] [2023-12-26 04:29:21,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 04:29:21,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:29:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 04:29:21,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 04:29:21,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-26 04:29:44,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-26 04:29:44,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 04:29:44,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 6301 conjuncts, 541 conjunts are in the unsatisfiable core [2023-12-26 04:29:44,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 04:30:35,372 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 1469 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:30:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:30:38,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 04:31:47,310 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 1017 DAG size of output: 1013 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:32:33,479 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification. DAG size of input: 1309 DAG size of output: 1309 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:33:53,537 WARN L293 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 3161 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:34:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 04:34:01,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 04:34:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29936588] [2023-12-26 04:34:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29936588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 04:34:01,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 04:34:01,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-26 04:34:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862213742] [2023-12-26 04:34:01,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 04:34:01,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-26 04:34:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 04:34:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-26 04:34:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2023-12-26 04:34:01,241 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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) [2023-12-26 04:34:02,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-26 04:34:52,348 WARN L293 SmtUtils]: Spent 29.32s on a formula simplification. DAG size of input: 2508 DAG size of output: 2335 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:34:57,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 04:35:02,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 04:35:46,893 WARN L293 SmtUtils]: Spent 30.69s on a formula simplification. DAG size of input: 2668 DAG size of output: 1735 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 04:35:48,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 04:35:58,224 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-26 04:35:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 04:35:58,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 310.2s TimeCoverageRelationStatistics Valid=76, Invalid=216, Unknown=14, NotChecked=0, Total=306 [2023-12-26 04:35:58,225 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-12-26 04:35:58,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2023-12-26 04:35:58,231 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 101 [2023-12-26 04:35:58,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-26 04:35:58,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 04:35:58,427 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2023-12-26 04:35:58,431 INFO L158 Benchmark]: Toolchain (without parser) took 441606.60ms. Allocated memory was 356.5MB in the beginning and 1.1GB in the end (delta: 761.3MB). Free memory was 302.3MB in the beginning and 575.2MB in the end (delta: -272.9MB). Peak memory consumption was 721.9MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,431 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 244.3MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 04:35:58,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1070.22ms. Allocated memory is still 356.5MB. Free memory was 302.3MB in the beginning and 272.5MB in the end (delta: 29.8MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.44ms. Allocated memory is still 356.5MB. Free memory was 272.5MB in the beginning and 289.2MB in the end (delta: -16.7MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,431 INFO L158 Benchmark]: Boogie Preprocessor took 179.48ms. Allocated memory is still 356.5MB. Free memory was 289.2MB in the beginning and 266.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,432 INFO L158 Benchmark]: RCFGBuilder took 4256.61ms. Allocated memory was 356.5MB in the beginning and 598.7MB in the end (delta: 242.2MB). Free memory was 266.0MB in the beginning and 449.2MB in the end (delta: -183.2MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,432 INFO L158 Benchmark]: TraceAbstraction took 435905.16ms. Allocated memory was 598.7MB in the beginning and 1.1GB in the end (delta: 519.0MB). Free memory was 448.7MB in the beginning and 575.2MB in the end (delta: -126.5MB). Peak memory consumption was 627.3MB. Max. memory is 8.0GB. [2023-12-26 04:35:58,433 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 244.3MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1070.22ms. Allocated memory is still 356.5MB. Free memory was 302.3MB in the beginning and 272.5MB in the end (delta: 29.8MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 188.44ms. Allocated memory is still 356.5MB. Free memory was 272.5MB in the beginning and 289.2MB in the end (delta: -16.7MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 179.48ms. Allocated memory is still 356.5MB. Free memory was 289.2MB in the beginning and 266.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4256.61ms. Allocated memory was 356.5MB in the beginning and 598.7MB in the end (delta: 242.2MB). Free memory was 266.0MB in the beginning and 449.2MB in the end (delta: -183.2MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. * TraceAbstraction took 435905.16ms. Allocated memory was 598.7MB in the beginning and 1.1GB in the end (delta: 519.0MB). Free memory was 448.7MB in the beginning and 575.2MB in the end (delta: -126.5MB). Peak memory consumption was 627.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...