/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-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 15:23:28,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 15:23:28,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 15:23:28,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 15:23:28,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 15:23:28,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 15:23:28,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 15:23:28,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 15:23:28,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 15:23:28,862 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 15:23:28,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 15:23:28,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 15:23:28,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 15:23:28,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 15:23:28,865 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 15:23:28,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 15:23:28,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 15:23:28,866 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 15:23:28,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 15:23:28,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 15:23:28,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 15:23:28,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 15:23:28,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 15:23:28,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 15:23:28,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 15:23:28,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 15:23:28,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 15:23:28,869 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 15:23:28,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 15:23:28,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 15:23:28,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 15:23:28,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 15:23:28,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 15:23:28,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 15:23:28,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 15:23:28,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 15:23:28,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 15:23:28,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 15:23:28,871 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 15:23:28,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 15:23:28,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 15:23:28,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 15:23:28,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 15:23:28,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 15:23:28,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 15:23:28,873 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 15:23:28,873 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-22 15:23:29,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 15:23:29,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 15:23:29,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 15:23:29,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 15:23:29,139 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 15:23:29,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label28.c [2023-12-22 15:23:30,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 15:23:30,684 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 15:23:30,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label28.c [2023-12-22 15:23:30,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b96eb45/a9d0aaf5a40a419eb9bf2e6ce19fe625/FLAG2f94feed5 [2023-12-22 15:23:30,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b96eb45/a9d0aaf5a40a419eb9bf2e6ce19fe625 [2023-12-22 15:23:30,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 15:23:30,729 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 15:23:30,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 15:23:30,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 15:23:30,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 15:23:30,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:23:30" (1/1) ... [2023-12-22 15:23:30,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114791aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:30, skipping insertion in model container [2023-12-22 15:23:30,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:23:30" (1/1) ... [2023-12-22 15:23:30,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 15:23:31,104 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label28.c[9518,9531] [2023-12-22 15:23:31,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 15:23:31,656 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 15:23:31,681 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label28.c[9518,9531] [2023-12-22 15:23:31,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 15:23:31,954 INFO L206 MainTranslator]: Completed translation [2023-12-22 15:23:31,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31 WrapperNode [2023-12-22 15:23:31,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 15:23:31,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 15:23:31,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 15:23:31,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 15:23:31,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,106 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2023-12-22 15:23:32,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 15:23:32,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 15:23:32,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 15:23:32,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 15:23:32,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,211 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-22 15:23:32,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 15:23:32,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 15:23:32,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 15:23:32,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 15:23:32,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (1/1) ... [2023-12-22 15:23:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 15:23:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 15:23:32,449 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-22 15:23:32,464 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-22 15:23:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 15:23:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 15:23:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 15:23:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 15:23:32,557 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 15:23:32,558 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 15:24:02,227 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 15:24:02,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 15:24:02,294 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 15:24:02,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:24:02 BoogieIcfgContainer [2023-12-22 15:24:02,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 15:24:02,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 15:24:02,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 15:24:02,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 15:24:02,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 03:23:30" (1/3) ... [2023-12-22 15:24:02,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c001be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:24:02, skipping insertion in model container [2023-12-22 15:24:02,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:23:31" (2/3) ... [2023-12-22 15:24:02,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c001be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:24:02, skipping insertion in model container [2023-12-22 15:24:02,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:24:02" (3/3) ... [2023-12-22 15:24:02,301 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label28.c [2023-12-22 15:24:02,317 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 15:24:02,317 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 15:24:02,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 15:24:02,373 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;@3daaa8b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 15:24:02,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 15:24:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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-22 15:24:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-22 15:24:02,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:24:02,387 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 15:24:02,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:24:02,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:24:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash 256259948, now seen corresponding path program 1 times [2023-12-22 15:24:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:24:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449166116] [2023-12-22 15:24:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:24:02,404 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-22 15:24:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:24:02,407 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-22 15:24:02,432 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-22 15:24:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:24:02,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 15:24:02,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:24:02,526 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-22 15:24:02,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 15:24:02,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:24:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449166116] [2023-12-22 15:24:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449166116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 15:24:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 15:24:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 15:24:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914924483] [2023-12-22 15:24:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 15:24:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 15:24:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:24:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 15:24:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 15:24:02,566 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-22 15:24:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 15:24:02,654 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2023-12-22 15:24:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 15:24:02,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2023-12-22 15:24:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 15:24:02,678 INFO L225 Difference]: With dead ends: 1055 [2023-12-22 15:24:02,678 INFO L226 Difference]: Without dead ends: 526 [2023-12-22 15:24:02,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-22 15:24:02,685 INFO L413 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 15:24:02,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 15:24:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-22 15:24:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2023-12-22 15:24:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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-22 15:24:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2023-12-22 15:24:02,750 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 63 [2023-12-22 15:24:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 15:24:02,750 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2023-12-22 15:24:02,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-22 15:24:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2023-12-22 15:24:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-22 15:24:02,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:24:02,752 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 15:24:02,759 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-22 15:24:02,955 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-22 15:24:02,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:24:02,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:24:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1630487590, now seen corresponding path program 1 times [2023-12-22 15:24:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:24:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850018664] [2023-12-22 15:24:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:24:02,959 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-22 15:24:02,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:24:02,960 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-22 15:24:02,972 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-22 15:24:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:24:03,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 15:24:03,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:24:03,662 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-22 15:24:03,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 15:24:03,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:24:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850018664] [2023-12-22 15:24:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850018664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 15:24:03,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 15:24:03,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 15:24:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819697532] [2023-12-22 15:24:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 15:24:03,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 15:24:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:24:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 15:24:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:24:03,669 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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-22 15:24:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 15:24:49,182 INFO L93 Difference]: Finished difference Result 1498 states and 2692 transitions. [2023-12-22 15:24:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 15:24:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2023-12-22 15:24:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 15:24:49,188 INFO L225 Difference]: With dead ends: 1498 [2023-12-22 15:24:49,188 INFO L226 Difference]: Without dead ends: 973 [2023-12-22 15:24:49,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:24:49,191 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 408 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2023-12-22 15:24:49,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 496 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 45.3s Time] [2023-12-22 15:24:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2023-12-22 15:24:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 970. [2023-12-22 15:24:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5087719298245614) internal successors, (1462), 969 states have internal predecessors, (1462), 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-22 15:24:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1462 transitions. [2023-12-22 15:24:49,226 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1462 transitions. Word has length 63 [2023-12-22 15:24:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 15:24:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1462 transitions. [2023-12-22 15:24:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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-22 15:24:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1462 transitions. [2023-12-22 15:24:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-22 15:24:49,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:24:49,230 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 15:24:49,238 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-22 15:24:49,433 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-22 15:24:49,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:24:49,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:24:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash -31283066, now seen corresponding path program 1 times [2023-12-22 15:24:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:24:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246561674] [2023-12-22 15:24:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:24:49,436 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-22 15:24:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:24:49,437 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-22 15:24:49,453 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-22 15:24:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:24:49,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 15:24:49,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:24:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 15:24:53,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 15:25:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 15:25:14,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:25:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246561674] [2023-12-22 15:25:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246561674] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 15:25:14,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 15:25:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-22 15:25:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971684450] [2023-12-22 15:25:14,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 15:25:14,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 15:25:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:25:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 15:25:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 15:25:14,261 INFO L87 Difference]: Start difference. First operand 970 states and 1462 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 5 states have internal predecessors, (230), 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-22 15:25:22,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:25:46,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:25:52,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:25:54,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:25:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:00,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:05,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:11,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:18,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:22,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:24,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:28,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:30,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:32,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:34,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:47,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:50,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:26:57,404 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 [] [2023-12-22 15:27:07,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:12,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:16,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:20,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:29,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:31,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:41,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:43,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:27:45,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:02,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:04,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:09,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:13,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:21,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:31,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:33,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:39,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:41,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:46,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:49,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:50,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:52,680 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 [] [2023-12-22 15:28:55,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:28:57,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:04,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:12,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:16,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:19,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:23,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:27,535 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 [] [2023-12-22 15:29:30,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:35,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:45,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:52,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:54,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:29:57,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:18,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:20,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:31,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:32,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:35,709 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 [] [2023-12-22 15:30:39,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:42,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:47,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:52,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:54,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:30:56,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:02,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:05,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:07,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:11,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:14,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:17,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:21,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:28,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:31,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:36,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:31:45,723 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 [] [2023-12-22 15:31:56,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:01,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:09,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:16,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:21,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:25,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:27,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:31,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:35,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:37,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:39,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:46,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:51,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:54,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:32:57,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:05,509 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 [] [2023-12-22 15:33:13,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:14,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:16,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:19,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:24,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:28,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:31,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:34,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:36,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:38,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:45,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:47,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:51,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:53,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:33:57,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:01,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:04,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:07,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:11,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:19,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:24,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:38,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:44,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:50,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:34:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 15:34:58,083 INFO L93 Difference]: Finished difference Result 2502 states and 3887 transitions. [2023-12-22 15:34:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 15:34:58,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 5 states have internal predecessors, (230), 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 133 [2023-12-22 15:34:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 15:34:58,104 INFO L225 Difference]: With dead ends: 2502 [2023-12-22 15:34:58,104 INFO L226 Difference]: Without dead ends: 1450 [2023-12-22 15:34:58,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-22 15:34:58,106 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 809 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 4166 mSolverCounterSat, 687 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 540.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 4166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 582.5s IncrementalHoareTripleChecker+Time [2023-12-22 15:34:58,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 286 Invalid, 4855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [687 Valid, 4166 Invalid, 2 Unknown, 0 Unchecked, 582.5s Time] [2023-12-22 15:34:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2023-12-22 15:34:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1435. [2023-12-22 15:34:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.4818688981868897) internal successors, (2125), 1434 states have internal predecessors, (2125), 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-22 15:34:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2125 transitions. [2023-12-22 15:34:58,140 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2125 transitions. Word has length 133 [2023-12-22 15:34:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 15:34:58,140 INFO L495 AbstractCegarLoop]: Abstraction has 1435 states and 2125 transitions. [2023-12-22 15:34:58,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 5 states have internal predecessors, (230), 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-22 15:34:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2125 transitions. [2023-12-22 15:34:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-22 15:34:58,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:34:58,145 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-22 15:34:58,153 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-22 15:34:58,353 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-22 15:34:58,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:34:58,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:34:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1022191802, now seen corresponding path program 1 times [2023-12-22 15:34:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:34:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398668844] [2023-12-22 15:34:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:34:58,356 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-22 15:34:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:34:58,357 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-22 15:34:58,358 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-22 15:34:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:34:58,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 15:34:58,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:34:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 15:34:59,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 15:35:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 15:35:00,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:35:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398668844] [2023-12-22 15:35:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398668844] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 15:35:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 15:35:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 15:35:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896273767] [2023-12-22 15:35:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 15:35:00,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 15:35:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:35:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 15:35:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 15:35:00,234 INFO L87 Difference]: Start difference. First operand 1435 states and 2125 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-22 15:35:28,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:35:44,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:36:14,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:36:16,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:36:22,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:36:27,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 15:36:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 15:36:51,110 INFO L93 Difference]: Finished difference Result 3325 states and 5324 transitions. [2023-12-22 15:36:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 15:36:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2023-12-22 15:36:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 15:36:51,125 INFO L225 Difference]: With dead ends: 3325 [2023-12-22 15:36:51,126 INFO L226 Difference]: Without dead ends: 2316 [2023-12-22 15:36:51,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 15:36:51,128 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 510 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 110.7s IncrementalHoareTripleChecker+Time [2023-12-22 15:36:51,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 633 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 110.7s Time] [2023-12-22 15:36:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2023-12-22 15:36:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2306. [2023-12-22 15:36:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.5084598698481562) internal successors, (3477), 2305 states have internal predecessors, (3477), 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-22 15:36:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3477 transitions. [2023-12-22 15:36:51,191 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3477 transitions. Word has length 146 [2023-12-22 15:36:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 15:36:51,191 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 3477 transitions. [2023-12-22 15:36:51,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-22 15:36:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3477 transitions. [2023-12-22 15:36:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-22 15:36:51,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:36:51,199 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-12-22 15:36:51,207 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 (5)] Forceful destruction successful, exit code 0 [2023-12-22 15:36:51,404 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-22 15:36:51,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:36:51,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:36:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash -555756627, now seen corresponding path program 1 times [2023-12-22 15:36:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:36:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163823540] [2023-12-22 15:36:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:36:51,406 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-22 15:36:51,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:36:51,407 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-22 15:36:51,429 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-22 15:36:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:36:51,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 15:36:51,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:36:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 15:36:51,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 15:36:51,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:36:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163823540] [2023-12-22 15:36:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163823540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 15:36:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 15:36:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 15:36:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462262692] [2023-12-22 15:36:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 15:36:51,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 15:36:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:36:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 15:36:51,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:36:51,994 INFO L87 Difference]: Start difference. First operand 2306 states and 3477 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-22 15:37:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 15:37:35,709 INFO L93 Difference]: Finished difference Result 5901 states and 9338 transitions. [2023-12-22 15:37:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 15:37:35,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 174 [2023-12-22 15:37:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 15:37:35,734 INFO L225 Difference]: With dead ends: 5901 [2023-12-22 15:37:35,734 INFO L226 Difference]: Without dead ends: 4021 [2023-12-22 15:37:35,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:37:35,739 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 501 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2023-12-22 15:37:35,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 809 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 43.6s Time] [2023-12-22 15:37:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2023-12-22 15:37:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 4021. [2023-12-22 15:37:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 4020 states have (on average 1.4291044776119404) internal successors, (5745), 4020 states have internal predecessors, (5745), 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-22 15:37:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5745 transitions. [2023-12-22 15:37:35,818 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5745 transitions. Word has length 174 [2023-12-22 15:37:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 15:37:35,819 INFO L495 AbstractCegarLoop]: Abstraction has 4021 states and 5745 transitions. [2023-12-22 15:37:35,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-22 15:37:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5745 transitions. [2023-12-22 15:37:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-22 15:37:35,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 15:37:35,823 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-22 15:37:35,833 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 (6)] Forceful destruction successful, exit code 0 [2023-12-22 15:37:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-22 15:37:36,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 15:37:36,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 15:37:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1022952367, now seen corresponding path program 1 times [2023-12-22 15:37:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 15:37:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188049988] [2023-12-22 15:37:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 15:37:36,036 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-22 15:37:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 15:37:36,039 INFO L229 MonitoredProcess]: Starting monitored process 7 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-22 15:37:36,039 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 (7)] Waiting until timeout for monitored process [2023-12-22 15:37:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 15:37:36,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 15:37:36,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 15:37:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-22 15:37:37,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 15:37:37,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 15:37:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188049988] [2023-12-22 15:37:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188049988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 15:37:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 15:37:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 15:37:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398471079] [2023-12-22 15:37:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 15:37:37,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 15:37:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 15:37:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 15:37:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:37:37,152 INFO L87 Difference]: Start difference. First operand 4021 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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) Received shutdown request... [2023-12-22 15:38:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 15:38:00,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 15:38:00,431 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 296 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2023-12-22 15:38:00,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 246 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2023-12-22 15:38:00,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 15:38:00,438 WARN L340 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 15:38:00,438 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 15:38:00,441 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 (7)] Forceful destruction successful, exit code 0 [2023-12-22 15:38:00,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-22 15:38:00,636 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (4021states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (4351 states constructed, input type IntersectNwa). [2023-12-22 15:38:00,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-22 15:38:00,642 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 15:38:00,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:38:00 BoogieIcfgContainer [2023-12-22 15:38:00,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 15:38:00,644 INFO L158 Benchmark]: Toolchain (without parser) took 869914.39ms. Allocated memory was 366.0MB in the beginning and 565.2MB in the end (delta: 199.2MB). Free memory was 304.5MB in the beginning and 426.0MB in the end (delta: -121.5MB). Peak memory consumption was 338.8MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,644 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 235.9MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 15:38:00,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1223.50ms. Allocated memory is still 366.0MB. Free memory was 304.2MB in the beginning and 209.2MB in the end (delta: 94.9MB). Peak memory consumption was 95.8MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.02ms. Allocated memory is still 366.0MB. Free memory was 208.7MB in the beginning and 185.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,645 INFO L158 Benchmark]: Boogie Preprocessor took 312.86ms. Allocated memory is still 366.0MB. Free memory was 185.6MB in the beginning and 307.2MB in the end (delta: -121.5MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,645 INFO L158 Benchmark]: RCFGBuilder took 29872.79ms. Allocated memory was 366.0MB in the beginning and 565.2MB in the end (delta: 199.2MB). Free memory was 307.2MB in the beginning and 395.1MB in the end (delta: -87.9MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,645 INFO L158 Benchmark]: TraceAbstraction took 838347.50ms. Allocated memory is still 565.2MB. Free memory was 394.0MB in the beginning and 426.0MB in the end (delta: -32.0MB). Peak memory consumption was 227.5MB. Max. memory is 8.0GB. [2023-12-22 15:38:00,646 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.60ms. Allocated memory is still 235.9MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1223.50ms. Allocated memory is still 366.0MB. Free memory was 304.2MB in the beginning and 209.2MB in the end (delta: 94.9MB). Peak memory consumption was 95.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 151.02ms. Allocated memory is still 366.0MB. Free memory was 208.7MB in the beginning and 185.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 312.86ms. Allocated memory is still 366.0MB. Free memory was 185.6MB in the beginning and 307.2MB in the end (delta: -121.5MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. * RCFGBuilder took 29872.79ms. Allocated memory was 366.0MB in the beginning and 565.2MB in the end (delta: 199.2MB). Free memory was 307.2MB in the beginning and 395.1MB in the end (delta: -87.9MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. * TraceAbstraction took 838347.50ms. Allocated memory is still 565.2MB. Free memory was 394.0MB in the beginning and 426.0MB in the end (delta: -32.0MB). Peak memory consumption was 227.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 210]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 210). Cancelled while NwaCegarLoop was constructing difference of abstraction (4021states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (4351 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 838.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 807.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2524 SdHoareTripleChecker+Valid, 805.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2524 mSDsluCounter, 3405 SdHoareTripleChecker+Invalid, 734.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 1957 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8845 IncrementalHoareTripleChecker+Invalid, 10804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1957 mSolverCounterUnsat, 2983 mSDtfsCounter, 8845 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4021occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 5706 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1060 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 381/494 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown