/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/recursive-simple/id_o1000.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:27:33,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:27:33,211 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-25 06:27:33,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:27:33,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:27:33,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:27:33,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:27:33,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:27:33,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:27:33,249 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:27:33,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:27:33,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:27:33,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:27:33,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:27:33,251 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:27:33,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:27:33,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:27:33,252 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:27:33,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:27:33,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:27:33,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:27:33,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:27:33,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:27:33,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:27:33,255 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:27:33,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:27:33,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:27:33,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:27:33,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:27:33,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:27:33,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:27:33,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:27:33,258 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:27:33,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:27:33,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:27:33,258 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:27:33,258 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-25 06:27:33,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:27:33,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:27:33,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:27:33,522 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:27:33,523 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:27:33,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o1000.c [2023-12-25 06:27:34,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:27:34,859 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:27:34,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o1000.c [2023-12-25 06:27:34,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3317cdb/31094553fe8040c3af1093f5b0861716/FLAG762117ed5 [2023-12-25 06:27:34,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3317cdb/31094553fe8040c3af1093f5b0861716 [2023-12-25 06:27:34,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:27:34,880 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:27:34,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:27:34,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:27:34,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:27:34,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:27:34" (1/1) ... [2023-12-25 06:27:34,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55920206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:34, skipping insertion in model container [2023-12-25 06:27:34,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:27:34" (1/1) ... [2023-12-25 06:27:34,901 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:27:35,033 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o1000.c[520,533] [2023-12-25 06:27:35,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:27:35,053 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:27:35,067 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o1000.c[520,533] [2023-12-25 06:27:35,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:27:35,079 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:27:35,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35 WrapperNode [2023-12-25 06:27:35,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:27:35,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:27:35,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:27:35,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:27:35,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,106 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-25 06:27:35,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:27:35,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:27:35,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:27:35,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:27:35,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,126 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-25 06:27:35,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:27:35,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:27:35,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:27:35,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:27:35,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (1/1) ... [2023-12-25 06:27:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:27:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:27:35,171 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-25 06:27:35,192 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-25 06:27:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:27:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:27:35,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:27:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:27:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-12-25 06:27:35,200 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-12-25 06:27:35,250 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:27:35,253 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:27:35,373 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:27:35,398 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:27:35,398 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:27:35,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:27:35 BoogieIcfgContainer [2023-12-25 06:27:35,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:27:35,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:27:35,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:27:35,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:27:35,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:27:34" (1/3) ... [2023-12-25 06:27:35,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:27:35, skipping insertion in model container [2023-12-25 06:27:35,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:27:35" (2/3) ... [2023-12-25 06:27:35,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:27:35, skipping insertion in model container [2023-12-25 06:27:35,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:27:35" (3/3) ... [2023-12-25 06:27:35,405 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o1000.c [2023-12-25 06:27:35,418 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:27:35,419 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:27:35,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:27:35,467 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;@761fac06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:27:35,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:27:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:27:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:27:35,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:35,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:35,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:35,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2023-12-25 06:27:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:35,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461882589] [2023-12-25 06:27:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:27:35,492 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-25 06:27:35,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:35,494 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-25 06:27:35,525 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-25 06:27:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:27:35,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:27:35,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:35,676 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-25 06:27:35,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:27:35,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461882589] [2023-12-25 06:27:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461882589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:27:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:27:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:27:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192299330] [2023-12-25 06:27:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:27:35,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:27:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:35,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:27:35,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:27:35,708 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:27:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:35,767 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-12-25 06:27:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:27:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:27:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:35,775 INFO L225 Difference]: With dead ends: 23 [2023-12-25 06:27:35,776 INFO L226 Difference]: Without dead ends: 14 [2023-12-25 06:27:35,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:27:35,783 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:35,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:27:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-25 06:27:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-25 06:27:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:27:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-25 06:27:35,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-12-25 06:27:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:35,816 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-25 06:27:35,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:27:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-25 06:27:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:27:35,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:35,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:35,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 06:27:36,020 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-25 06:27:36,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:36,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2023-12-25 06:27:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651402794] [2023-12-25 06:27:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:27:36,024 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-25 06:27:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:36,045 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-25 06:27:36,079 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-25 06:27:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:27:36,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:27:36,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:27:36,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:27:36,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651402794] [2023-12-25 06:27:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651402794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:36,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-25 06:27:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584984765] [2023-12-25 06:27:36,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:36,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:27:36,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:36,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:27:36,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:27:36,316 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 06:27:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:36,374 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2023-12-25 06:27:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:27:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 15 [2023-12-25 06:27:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:36,376 INFO L225 Difference]: With dead ends: 26 [2023-12-25 06:27:36,376 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 06:27:36,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:27:36,380 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:36,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:27:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 06:27:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 06:27:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:27:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-25 06:27:36,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2023-12-25 06:27:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:36,389 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-25 06:27:36,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 06:27:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-25 06:27:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 06:27:36,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:36,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:36,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 06:27:36,596 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-25 06:27:36,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:36,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 2 times [2023-12-25 06:27:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725291939] [2023-12-25 06:27:36,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:27:36,598 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-25 06:27:36,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:36,603 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-25 06:27:36,609 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-25 06:27:36,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:27:36,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:36,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:27:36,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:27:36,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:27:36,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725291939] [2023-12-25 06:27:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725291939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:36,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-25 06:27:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492898474] [2023-12-25 06:27:36,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:36,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:27:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:36,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:27:36,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:27:36,989 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-25 06:27:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:37,125 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-12-25 06:27:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 06:27:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 27 [2023-12-25 06:27:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:37,128 INFO L225 Difference]: With dead ends: 38 [2023-12-25 06:27:37,128 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:27:37,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2023-12-25 06:27:37,129 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:37,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:27:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 06:27:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 06:27:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-12-25 06:27:37,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2023-12-25 06:27:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:37,134 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-12-25 06:27:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-25 06:27:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-12-25 06:27:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 06:27:37,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:37,136 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:37,143 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-25 06:27:37,344 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-25 06:27:37,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:37,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 3 times [2023-12-25 06:27:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691976823] [2023-12-25 06:27:37,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:27:37,346 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-25 06:27:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:37,349 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-25 06:27:37,350 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-25 06:27:37,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-25 06:27:37,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:37,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:27:37,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-25 06:27:37,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-25 06:27:38,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691976823] [2023-12-25 06:27:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691976823] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:38,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2023-12-25 06:27:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092758137] [2023-12-25 06:27:38,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:38,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:27:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:27:38,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1076, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 06:27:38,337 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 20 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-25 06:27:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:38,800 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2023-12-25 06:27:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 06:27:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 20 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 51 [2023-12-25 06:27:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:38,802 INFO L225 Difference]: With dead ends: 62 [2023-12-25 06:27:38,802 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 06:27:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=382, Invalid=1874, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 06:27:38,804 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:38,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 06:27:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-25 06:27:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 06:27:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-12-25 06:27:38,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 51 [2023-12-25 06:27:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:38,812 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-12-25 06:27:38,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 20 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-25 06:27:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-12-25 06:27:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 06:27:38,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:38,814 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:38,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 06:27:39,017 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-25 06:27:39,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:39,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 4 times [2023-12-25 06:27:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88063074] [2023-12-25 06:27:39,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:27:39,019 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-25 06:27:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:39,028 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-25 06:27:39,042 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-25 06:27:39,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:27:39,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:39,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 06:27:39,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-12-25 06:27:39,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-12-25 06:27:42,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88063074] [2023-12-25 06:27:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88063074] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:42,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2023-12-25 06:27:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76126801] [2023-12-25 06:27:42,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:42,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-25 06:27:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:42,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-25 06:27:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3940, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 06:27:42,033 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 68 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-25 06:27:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:44,142 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2023-12-25 06:27:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-25 06:27:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 99 [2023-12-25 06:27:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:44,145 INFO L225 Difference]: With dead ends: 110 [2023-12-25 06:27:44,145 INFO L226 Difference]: Without dead ends: 104 [2023-12-25 06:27:44,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1526, Invalid=7594, Unknown=0, NotChecked=0, Total=9120 [2023-12-25 06:27:44,150 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:44,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1165 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:27:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-25 06:27:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-25 06:27:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 70 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-25 06:27:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2023-12-25 06:27:44,180 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 99 [2023-12-25 06:27:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:44,180 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2023-12-25 06:27:44,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-25 06:27:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2023-12-25 06:27:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-25 06:27:44,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:44,183 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:44,201 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-25 06:27:44,401 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-25 06:27:44,402 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:44,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1940660750, now seen corresponding path program 5 times [2023-12-25 06:27:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187082812] [2023-12-25 06:27:44,403 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:27:44,403 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-25 06:27:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:44,425 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-25 06:27:44,459 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-25 06:27:44,746 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2023-12-25 06:27:44,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:44,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-25 06:27:44,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2023-12-25 06:27:46,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2023-12-25 06:27:54,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:54,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187082812] [2023-12-25 06:27:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187082812] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:54,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2023-12-25 06:27:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156521946] [2023-12-25 06:27:54,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:54,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2023-12-25 06:27:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2023-12-25 06:27:54,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2248, Invalid=15044, Unknown=0, NotChecked=0, Total=17292 [2023-12-25 06:27:54,180 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 132 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 68 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64) [2023-12-25 06:28:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:03,558 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2023-12-25 06:28:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-12-25 06:28:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 68 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64) Word has length 195 [2023-12-25 06:28:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:03,561 INFO L225 Difference]: With dead ends: 206 [2023-12-25 06:28:03,561 INFO L226 Difference]: Without dead ends: 200 [2023-12-25 06:28:03,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=6118, Invalid=30554, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 06:28:03,570 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 3845 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:03,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3917 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 06:28:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-25 06:28:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-12-25 06:28:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.0075187969924813) internal successors, (134), 134 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (65), 64 states have call predecessors, (65), 2 states have call successors, (65) [2023-12-25 06:28:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2023-12-25 06:28:03,585 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 195 [2023-12-25 06:28:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:03,585 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2023-12-25 06:28:03,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 68 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64) [2023-12-25 06:28:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2023-12-25 06:28:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2023-12-25 06:28:03,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:03,590 INFO L195 NwaCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:03,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 06:28:03,794 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-25 06:28:03,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:03,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash 480810510, now seen corresponding path program 6 times [2023-12-25 06:28:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:03,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067931761] [2023-12-25 06:28:03,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:28:03,796 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-25 06:28:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:03,797 INFO L229 MonitoredProcess]: Starting monitored process 8 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-25 06:28:03,799 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 (8)] Waiting until timeout for monitored process [2023-12-25 06:28:04,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2023-12-25 06:28:04,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:04,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 130 conjunts are in the unsatisfiable core [2023-12-25 06:28:04,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 5985 trivial. 0 not checked. [2023-12-25 06:28:10,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 5985 trivial. 0 not checked. [2023-12-25 06:28:36,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067931761] [2023-12-25 06:28:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067931761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:36,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 260 [2023-12-25 06:28:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762354689] [2023-12-25 06:28:36,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:36,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2023-12-25 06:28:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2023-12-25 06:28:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8584, Invalid=58756, Unknown=0, NotChecked=0, Total=67340 [2023-12-25 06:28:36,713 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand has 260 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 132 states have internal predecessors, (264), 1 states have call successors, (2), 1 states have call predecessors, (2), 128 states have return successors, (128), 128 states have call predecessors, (128), 1 states have call successors, (128) [2023-12-25 06:29:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:26,491 INFO L93 Difference]: Finished difference Result 398 states and 462 transitions. [2023-12-25 06:29:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2023-12-25 06:29:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 132 states have internal predecessors, (264), 1 states have call successors, (2), 1 states have call predecessors, (2), 128 states have return successors, (128), 128 states have call predecessors, (128), 1 states have call successors, (128) Word has length 387 [2023-12-25 06:29:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:26,505 INFO L225 Difference]: With dead ends: 398 [2023-12-25 06:29:26,505 INFO L226 Difference]: Without dead ends: 392 [2023-12-25 06:29:26,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11913 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=24518, Invalid=122554, Unknown=0, NotChecked=0, Total=147072 [2023-12-25 06:29:26,518 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 13654 mSDsCounter, 0 mSdLazyCounter, 12679 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13790 SdHoareTripleChecker+Invalid, 12679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:26,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13790 Invalid, 12679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12679 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 06:29:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-25 06:29:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-12-25 06:29:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 261 states have (on average 1.003831417624521) internal successors, (262), 262 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 128 states have return successors, (129), 128 states have call predecessors, (129), 2 states have call successors, (129) [2023-12-25 06:29:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2023-12-25 06:29:26,565 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 387 [2023-12-25 06:29:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:26,566 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2023-12-25 06:29:26,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 132 states have internal predecessors, (264), 1 states have call successors, (2), 1 states have call predecessors, (2), 128 states have return successors, (128), 128 states have call predecessors, (128), 1 states have call successors, (128) [2023-12-25 06:29:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2023-12-25 06:29:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2023-12-25 06:29:26,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:26,607 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:26,613 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 06:29:26,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-25 06:29:26,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:26,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash 244416014, now seen corresponding path program 7 times [2023-12-25 06:29:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382021769] [2023-12-25 06:29:26,810 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:29:26,810 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-25 06:29:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:26,812 INFO L229 MonitoredProcess]: Starting monitored process 9 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-25 06:29:26,817 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 (9)] Waiting until timeout for monitored process [2023-12-25 06:29:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:29:28,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 258 conjunts are in the unsatisfiable core [2023-12-25 06:29:28,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 48514 backedges. 0 proven. 24257 refuted. 0 times theorem prover too weak. 24257 trivial. 0 not checked. [2023-12-25 06:29:53,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 48514 backedges. 0 proven. 24257 refuted. 0 times theorem prover too weak. 24257 trivial. 0 not checked. [2023-12-25 06:31:27,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382021769] [2023-12-25 06:31:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382021769] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:27,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [259, 259] total 516 [2023-12-25 06:31:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056879559] [2023-12-25 06:31:27,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:27,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 516 states [2023-12-25 06:31:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 516 interpolants. [2023-12-25 06:31:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33544, Invalid=232196, Unknown=0, NotChecked=0, Total=265740 [2023-12-25 06:31:27,468 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand has 516 states, 516 states have (on average 1.0077519379844961) internal successors, (520), 260 states have internal predecessors, (520), 1 states have call successors, (2), 1 states have call predecessors, (2), 256 states have return successors, (256), 256 states have call predecessors, (256), 1 states have call successors, (256) [2023-12-25 06:37:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:07,043 INFO L93 Difference]: Finished difference Result 782 states and 910 transitions. [2023-12-25 06:37:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 515 states. [2023-12-25 06:37:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 516 states, 516 states have (on average 1.0077519379844961) internal successors, (520), 260 states have internal predecessors, (520), 1 states have call successors, (2), 1 states have call predecessors, (2), 256 states have return successors, (256), 256 states have call predecessors, (256), 1 states have call successors, (256) Word has length 771 [2023-12-25 06:37:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:07,060 INFO L225 Difference]: With dead ends: 782 [2023-12-25 06:37:07,060 INFO L226 Difference]: Without dead ends: 776 [2023-12-25 06:37:07,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1792 GetRequests, 1026 SyntacticMatches, 0 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48393 ImplicationChecksByTransitivity, 394.5s TimeCoverageRelationStatistics Valid=98182, Invalid=490874, Unknown=0, NotChecked=0, Total=589056 [2023-12-25 06:37:07,110 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 51598 mSDsCounter, 0 mSdLazyCounter, 49671 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51862 SdHoareTripleChecker+Invalid, 49671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:07,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51862 Invalid, 49671 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [0 Valid, 49671 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2023-12-25 06:37:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-25 06:37:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2023-12-25 06:37:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 517 states have (on average 1.001934235976789) internal successors, (518), 518 states have internal predecessors, (518), 2 states have call successors, (2), 1 states have call predecessors, (2), 256 states have return successors, (257), 256 states have call predecessors, (257), 2 states have call successors, (257) [2023-12-25 06:37:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 777 transitions. [2023-12-25 06:37:07,171 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 777 transitions. Word has length 771 [2023-12-25 06:37:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:07,172 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 777 transitions. [2023-12-25 06:37:07,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 516 states, 516 states have (on average 1.0077519379844961) internal successors, (520), 260 states have internal predecessors, (520), 1 states have call successors, (2), 1 states have call predecessors, (2), 256 states have return successors, (256), 256 states have call predecessors, (256), 1 states have call successors, (256) [2023-12-25 06:37:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 777 transitions. [2023-12-25 06:37:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1540 [2023-12-25 06:37:07,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:07,191 INFO L195 NwaCegarLoop]: trace histogram [256, 256, 255, 255, 255, 255, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:07,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 06:37:07,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-25 06:37:07,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:07,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1914916366, now seen corresponding path program 8 times [2023-12-25 06:37:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345322272] [2023-12-25 06:37:07,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:07,405 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-25 06:37:07,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:07,407 INFO L229 MonitoredProcess]: Starting monitored process 10 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-25 06:37:07,433 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 (10)] Waiting until timeout for monitored process [2023-12-25 06:37:16,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:16,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:16,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 514 conjunts are in the unsatisfiable core [2023-12-25 06:37:16,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:38:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 195330 backedges. 0 proven. 97665 refuted. 0 times theorem prover too weak. 97665 trivial. 0 not checked. [2023-12-25 06:38:26,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 06:41:52,952 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:41:52,962 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 06:41:52,962 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-25 06:41:52,974 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 06:41:53,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-25 06:41:53,153 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 1540 with TraceHistMax 256,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 792 known predicates. [2023-12-25 06:41:53,157 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1] [2023-12-25 06:41:53,158 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:41:53,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:41:53 BoogieIcfgContainer [2023-12-25 06:41:53,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:41:53,161 INFO L158 Benchmark]: Toolchain (without parser) took 858281.01ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 148.2MB in the beginning and 929.3MB in the end (delta: -781.2MB). Peak memory consumption was 375.4MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,161 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 200.3MB. Free memory was 147.4MB in the beginning and 147.2MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:41:53,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.87ms. Allocated memory is still 200.3MB. Free memory was 147.8MB in the beginning and 137.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.29ms. Allocated memory is still 200.3MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,163 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 200.3MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,164 INFO L158 Benchmark]: RCFGBuilder took 259.91ms. Allocated memory is still 200.3MB. Free memory was 134.2MB in the beginning and 124.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,164 INFO L158 Benchmark]: TraceAbstraction took 857760.48ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.4MB in the beginning and 929.3MB in the end (delta: -805.9MB). Peak memory consumption was 350.2MB. Max. memory is 8.0GB. [2023-12-25 06:41:53,166 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.18ms. Allocated memory is still 200.3MB. Free memory was 147.4MB in the beginning and 147.2MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.87ms. Allocated memory is still 200.3MB. Free memory was 147.8MB in the beginning and 137.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.29ms. Allocated memory is still 200.3MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 200.3MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.91ms. Allocated memory is still 200.3MB. Free memory was 134.2MB in the beginning and 124.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 857760.48ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.4MB in the beginning and 929.3MB in the end (delta: -805.9MB). Peak memory consumption was 350.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 1540 with TraceHistMax 256,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 792 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 857.7s, OverallIterations: 9, TraceHistogramMax: 256, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 401.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 21.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 71491 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70916 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66900 IncrementalHoareTripleChecker+Invalid, 66900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 575 mSDtfsCounter, 66900 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3564 GetRequests, 2051 SyntacticMatches, 0 SemanticMatches, 1513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64071 ImplicationChecksByTransitivity, 477.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=776occurred in iteration=8, InterpolantAutomatonStates: 1042, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 164.7s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 3084 ConstructedInterpolants, 0 QuantifiedInterpolants, 6937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2160 ConjunctsInSsa, 526 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 64276/128552 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