/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.arbitrated_top_n5_w16_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 03:22:45,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 03:22:45,160 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 03:22:45,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 03:22:45,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 03:22:45,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 03:22:45,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 03:22:45,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 03:22:45,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 03:22:45,186 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 03:22:45,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 03:22:45,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 03:22:45,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 03:22:45,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 03:22:45,187 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 03:22:45,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 03:22:45,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 03:22:45,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 03:22:45,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 03:22:45,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 03:22:45,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 03:22:45,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 03:22:45,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 03:22:45,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 03:22:45,190 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 03:22:45,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 03:22:45,191 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 03:22:45,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 03:22:45,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 03:22:45,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 03:22:45,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 03:22:45,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 03:22:45,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 03:22:45,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 03:22:45,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 03:22:45,193 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 03:22:45,193 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 03:22:45,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 03:22:45,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 03:22:45,194 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 03:22:45,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 03:22:45,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 03:22:45,195 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 03:22:45,195 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 03:22:45,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 03:22:45,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 03:22:45,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 03:22:45,449 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 03:22:45,449 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 03:22:45,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w16_d16_e0.c [2023-12-26 03:22:46,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 03:22:46,745 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 03:22:46,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w16_d16_e0.c [2023-12-26 03:22:46,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820c4bb77/a1163c4081b5403bb8578d0a57a3c0cc/FLAG8d8d8dd35 [2023-12-26 03:22:46,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820c4bb77/a1163c4081b5403bb8578d0a57a3c0cc [2023-12-26 03:22:46,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 03:22:46,793 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 03:22:46,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 03:22:46,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 03:22:46,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 03:22:46,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 03:22:46" (1/1) ... [2023-12-26 03:22:46,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f80647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:46, skipping insertion in model container [2023-12-26 03:22:46,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 03:22:46" (1/1) ... [2023-12-26 03:22:46,873 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 03:22:47,068 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.arbitrated_top_n5_w16_d16_e0.c[1325,1338] [2023-12-26 03:22:47,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 03:22:47,591 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 03:22:47,600 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.arbitrated_top_n5_w16_d16_e0.c[1325,1338] [2023-12-26 03:22:47,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 03:22:47,780 INFO L206 MainTranslator]: Completed translation [2023-12-26 03:22:47,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47 WrapperNode [2023-12-26 03:22:47,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 03:22:47,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 03:22:47,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 03:22:47,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 03:22:47,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:47,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,034 INFO L138 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3854 [2023-12-26 03:22:48,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 03:22:48,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 03:22:48,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 03:22:48,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 03:22:48,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,152 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 03:22:48,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 03:22:48,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 03:22:48,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 03:22:48,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 03:22:48,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (1/1) ... [2023-12-26 03:22:48,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 03:22:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 03:22:48,321 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 03:22:48,399 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 03:22:48,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 03:22:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 03:22:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-26 03:22:48,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-26 03:22:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 03:22:48,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 03:22:48,923 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 03:22:48,925 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 03:22:53,081 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 03:22:53,245 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 03:22:53,246 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 03:22:53,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 03:22:53 BoogieIcfgContainer [2023-12-26 03:22:53,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 03:22:53,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 03:22:53,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 03:22:53,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 03:22:53,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 03:22:46" (1/3) ... [2023-12-26 03:22:53,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 03:22:53, skipping insertion in model container [2023-12-26 03:22:53,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 03:22:47" (2/3) ... [2023-12-26 03:22:53,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 03:22:53, skipping insertion in model container [2023-12-26 03:22:53,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 03:22:53" (3/3) ... [2023-12-26 03:22:53,254 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n5_w16_d16_e0.c [2023-12-26 03:22:53,268 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 03:22:53,268 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 03:22:53,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 03:22:53,315 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;@46e5ab01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 03:22:53,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 03:22:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-26 03:22:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-26 03:22:53,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 03:22:53,329 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 03:22:53,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 03:22:53,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 03:22:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -870637129, now seen corresponding path program 1 times [2023-12-26 03:22:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 03:22:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667313769] [2023-12-26 03:22:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 03:22:53,350 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 03:22:53,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 03:22:53,360 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 03:22:53,364 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 03:22:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 03:22:54,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-26 03:22:54,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:22:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2023-12-26 03:22:54,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 03:22:54,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 03:22:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667313769] [2023-12-26 03:22:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667313769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 03:22:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 03:22:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-26 03:22:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392601804] [2023-12-26 03:22:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 03:22:54,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-26 03:22:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 03:22:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-26 03:22:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-26 03:22:54,534 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-26 03:22:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 03:22:54,596 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2023-12-26 03:22:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-26 03:22:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2023-12-26 03:22:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 03:22:54,609 INFO L225 Difference]: With dead ends: 85 [2023-12-26 03:22:54,609 INFO L226 Difference]: Without dead ends: 42 [2023-12-26 03:22:54,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-26 03:22:54,615 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 03:22:54,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 03:22:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-26 03:22:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-26 03:22:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-26 03:22:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2023-12-26 03:22:54,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 100 [2023-12-26 03:22:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 03:22:54,656 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2023-12-26 03:22:54,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-26 03:22:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2023-12-26 03:22:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-26 03:22:54,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 03:22:54,661 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 03:22:54,675 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 03:22:54,874 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 03:22:54,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 03:22:54,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 03:22:54,875 INFO L85 PathProgramCache]: Analyzing trace with hash -664786537, now seen corresponding path program 1 times [2023-12-26 03:22:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 03:22:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870388408] [2023-12-26 03:22:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 03:22:54,878 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 03:22:54,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 03:22:54,880 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 03:22:54,885 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 03:22:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 03:22:56,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-26 03:22:57,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:22:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-26 03:22:57,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 03:22:57,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 03:22:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870388408] [2023-12-26 03:22:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870388408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 03:22:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 03:22:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-26 03:22:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408068622] [2023-12-26 03:22:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 03:22:57,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 03:22:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 03:22:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 03:22:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 03:22:57,444 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-26 03:22:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 03:22:58,024 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2023-12-26 03:22:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 03:22:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-12-26 03:22:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 03:22:58,026 INFO L225 Difference]: With dead ends: 79 [2023-12-26 03:22:58,026 INFO L226 Difference]: Without dead ends: 77 [2023-12-26 03:22:58,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 03:22:58,028 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-26 03:22:58,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-26 03:22:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-26 03:22:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-12-26 03:22:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-26 03:22:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2023-12-26 03:22:58,044 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 100 [2023-12-26 03:22:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 03:22:58,046 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2023-12-26 03:22:58,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-26 03:22:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2023-12-26 03:22:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-26 03:22:58,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 03:22:58,049 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-26 03:22:58,064 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 (3)] Ended with exit code 0 [2023-12-26 03:22:58,263 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 03:22:58,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 03:22:58,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 03:22:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash 11346597, now seen corresponding path program 1 times [2023-12-26 03:22:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 03:22:58,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520816146] [2023-12-26 03:22:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 03:22:58,269 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 03:22:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 03:22:58,270 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 03:22:58,271 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 03:23:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 03:23:18,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 4714 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-26 03:23:18,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:23:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-26 03:23:19,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 03:23:19,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 03:23:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520816146] [2023-12-26 03:23:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520816146] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 03:23:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [829472304] [2023-12-26 03:23:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 03:23:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-26 03:23:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-26 03:23:20,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-26 03:23:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-26 03:23:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 03:23:23,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 4714 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-26 03:23:23,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:23:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-26 03:23:24,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 03:23:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [829472304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 03:23:24,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 03:23:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-12-26 03:23:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924686963] [2023-12-26 03:23:24,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 03:23:24,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-26 03:23:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 03:23:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-26 03:23:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-12-26 03:23:24,338 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. Second operand has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) [2023-12-26 03:23:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 03:23:26,123 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2023-12-26 03:23:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-26 03:23:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) Word has length 199 [2023-12-26 03:23:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 03:23:26,127 INFO L225 Difference]: With dead ends: 114 [2023-12-26 03:23:26,127 INFO L226 Difference]: Without dead ends: 112 [2023-12-26 03:23:26,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-12-26 03:23:26,129 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-26 03:23:26,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 255 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-26 03:23:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-26 03:23:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-12-26 03:23:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-26 03:23:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2023-12-26 03:23:26,151 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 199 [2023-12-26 03:23:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 03:23:26,152 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2023-12-26 03:23:26,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) [2023-12-26 03:23:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2023-12-26 03:23:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-12-26 03:23:26,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 03:23:26,156 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-26 03:23:26,191 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 (4)] Ended with exit code 0 [2023-12-26 03:23:26,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-26 03:23:26,557 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-26 03:23:26,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 03:23:26,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 03:23:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash -206565673, now seen corresponding path program 2 times [2023-12-26 03:23:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 03:23:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859280522] [2023-12-26 03:23:26,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 03:23:26,564 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 03:23:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 03:23:26,566 INFO L229 MonitoredProcess]: Starting monitored process 6 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 03:23:26,603 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 (6)] Waiting until timeout for monitored process [2023-12-26 03:24:19,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 03:24:19,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 03:24:19,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 7885 conjuncts, 217 conjunts are in the unsatisfiable core [2023-12-26 03:24:19,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:24:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4615 backedges. 405 proven. 343 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2023-12-26 03:24:44,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 03:24:45,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 03:24:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859280522] [2023-12-26 03:24:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859280522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 03:24:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [754128416] [2023-12-26 03:24:45,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 03:24:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-26 03:24:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-26 03:24:45,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-26 03:24:45,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-26 03:24:50,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 03:24:50,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 03:24:51,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 7885 conjuncts, 204 conjunts are in the unsatisfiable core [2023-12-26 03:24:51,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 03:25:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4615 backedges. 339 proven. 292 refuted. 0 times theorem prover too weak. 3984 trivial. 0 not checked. [2023-12-26 03:25:47,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 03:25:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [754128416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 03:25:47,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 03:25:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 30 [2023-12-26 03:25:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334618170] [2023-12-26 03:25:47,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 03:25:47,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-26 03:25:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 03:25:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-26 03:25:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=854, Unknown=13, NotChecked=0, Total=992 [2023-12-26 03:25:47,552 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 30 states, 22 states have (on average 4.363636363636363) internal successors, (96), 28 states have internal predecessors, (96), 18 states have call successors, (76), 1 states have call predecessors, (76), 2 states have return successors, (76), 12 states have call predecessors, (76), 18 states have call successors, (76) [2023-12-26 03:25:54,058 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] [2023-12-26 03:25:59,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:04,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:08,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:12,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:17,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:21,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:29,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:33,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:35,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:54,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:26:58,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:01,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:06,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:41,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:45,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:50,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:54,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:27:58,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:02,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:05,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:07,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:11,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:15,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:20,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:24,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:29,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:33,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:37,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:41,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:28:45,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:29:23,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:29:27,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:14,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:18,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:19,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:24,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:29,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:31,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:36,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:39,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:41,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:30:46,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:17,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:21,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:26,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:30,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:34,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:39,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:41,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:43,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:31:48,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:32:24,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:33:01,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:33:05,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:33:09,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:33:13,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:34:03,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 03:34:12,141 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 03:34:12,142 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 03:34:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-26 03:34:12,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 329.9s TimeCoverageRelationStatistics Valid=391, Invalid=1900, Unknown=61, NotChecked=0, Total=2352 [2023-12-26 03:34:12,144 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 99 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 71 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 226.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 233.4s IncrementalHoareTripleChecker+Time [2023-12-26 03:34:12,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 595 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1401 Invalid, 44 Unknown, 0 Unchecked, 233.4s Time] [2023-12-26 03:34:12,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-26 03:34:12,415 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 (6)] Ended with exit code 0 [2023-12-26 03:34:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 03:34:12,565 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) 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) ... 48 more [2023-12-26 03:34:12,569 INFO L158 Benchmark]: Toolchain (without parser) took 685775.91ms. Allocated memory was 280.0MB in the beginning and 798.0MB in the end (delta: 518.0MB). Free memory was 219.1MB in the beginning and 488.4MB in the end (delta: -269.3MB). Peak memory consumption was 249.8MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,569 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory was 153.2MB in the beginning and 153.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 03:34:12,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.60ms. Allocated memory is still 280.0MB. Free memory was 218.6MB in the beginning and 166.8MB in the end (delta: 51.7MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 251.30ms. Allocated memory is still 280.0MB. Free memory was 166.8MB in the beginning and 212.2MB in the end (delta: -45.4MB). Peak memory consumption was 50.7MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,570 INFO L158 Benchmark]: Boogie Preprocessor took 253.32ms. Allocated memory is still 280.0MB. Free memory was 212.2MB in the beginning and 178.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,570 INFO L158 Benchmark]: RCFGBuilder took 4956.70ms. Allocated memory was 280.0MB in the beginning and 653.3MB in the end (delta: 373.3MB). Free memory was 178.7MB in the beginning and 451.0MB in the end (delta: -272.4MB). Peak memory consumption was 279.7MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,570 INFO L158 Benchmark]: TraceAbstraction took 679320.47ms. Allocated memory was 653.3MB in the beginning and 798.0MB in the end (delta: 144.7MB). Free memory was 450.0MB in the beginning and 488.4MB in the end (delta: -38.4MB). Peak memory consumption was 106.9MB. Max. memory is 8.0GB. [2023-12-26 03:34:12,571 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.11ms. Allocated memory is still 207.6MB. Free memory was 153.2MB in the beginning and 153.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 987.60ms. Allocated memory is still 280.0MB. Free memory was 218.6MB in the beginning and 166.8MB in the end (delta: 51.7MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 251.30ms. Allocated memory is still 280.0MB. Free memory was 166.8MB in the beginning and 212.2MB in the end (delta: -45.4MB). Peak memory consumption was 50.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 253.32ms. Allocated memory is still 280.0MB. Free memory was 212.2MB in the beginning and 178.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * RCFGBuilder took 4956.70ms. Allocated memory was 280.0MB in the beginning and 653.3MB in the end (delta: 373.3MB). Free memory was 178.7MB in the beginning and 451.0MB in the end (delta: -272.4MB). Peak memory consumption was 279.7MB. Max. memory is 8.0GB. * TraceAbstraction took 679320.47ms. Allocated memory was 653.3MB in the beginning and 798.0MB in the end (delta: 144.7MB). Free memory was 450.0MB in the beginning and 488.4MB in the end (delta: -38.4MB). Peak memory consumption was 106.9MB. 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...