/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/array-lopstr16/flag_loopdep_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:03:51,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:03:51,941 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-21 20:03:51,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:03:51,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:03:51,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:03:51,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:03:51,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:03:51,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:03:51,970 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:03:51,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:03:51,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:03:51,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:03:51,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:03:51,971 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:03:51,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:03:51,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:03:51,972 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:03:51,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:03:51,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:03:51,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:03:51,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:03:51,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:03:51,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:03:51,978 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:03:51,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:03:51,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:03:51,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:03:51,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:03:51,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:03:51,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:03:51,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:03:51,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:03:51,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:03:51,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:03:51,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:03:51,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:03:51,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:03:51,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:03:51,982 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:03:51,982 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-21 20:03:52,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:03:52,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:03:52,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:03:52,212 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:03:52,212 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:03:52,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep_simple.i [2023-12-21 20:03:53,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:03:53,469 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:03:53,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep_simple.i [2023-12-21 20:03:53,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77960cdec/fd2b9faf390c47a19cab5384351977e1/FLAG52764bb06 [2023-12-21 20:03:53,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77960cdec/fd2b9faf390c47a19cab5384351977e1 [2023-12-21 20:03:53,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:03:53,493 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:03:53,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:03:53,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:03:53,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:03:53,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38717122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53, skipping insertion in model container [2023-12-21 20:03:53,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:03:53,637 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep_simple.i[812,825] [2023-12-21 20:03:53,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:03:53,667 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:03:53,678 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep_simple.i[812,825] [2023-12-21 20:03:53,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:03:53,697 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:03:53,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53 WrapperNode [2023-12-21 20:03:53,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:03:53,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:03:53,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:03:53,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:03:53,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,724 INFO L138 Inliner]: procedures = 19, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-12-21 20:03:53,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:03:53,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:03:53,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:03:53,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:03:53,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,742 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-21 20:03:53,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:03:53,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:03:53,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:03:53,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:03:53,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (1/1) ... [2023-12-21 20:03:53,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:03:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:03:53,771 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-21 20:03:53,783 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-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 20:03:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 20:03:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:03:53,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:03:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 20:03:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 20:03:53,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 20:03:53,853 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:03:53,854 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:03:53,953 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:03:53,975 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:03:53,976 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 20:03:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:03:53 BoogieIcfgContainer [2023-12-21 20:03:53,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:03:53,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:03:53,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:03:53,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:03:53,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:03:53" (1/3) ... [2023-12-21 20:03:53,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc9f08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:03:53, skipping insertion in model container [2023-12-21 20:03:53,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:03:53" (2/3) ... [2023-12-21 20:03:53,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc9f08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:03:53, skipping insertion in model container [2023-12-21 20:03:53,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:03:53" (3/3) ... [2023-12-21 20:03:53,981 INFO L112 eAbstractionObserver]: Analyzing ICFG flag_loopdep_simple.i [2023-12-21 20:03:53,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:03:53,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:03:54,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:03:54,024 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;@76861d72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:03:54,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:03:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 20:03:54,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:54,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:54,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:54,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1300637357, now seen corresponding path program 1 times [2023-12-21 20:03:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640919288] [2023-12-21 20:03:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:03:54,049 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-21 20:03:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:54,051 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-21 20:03:54,052 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-21 20:03:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:03:54,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:03:54,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:54,124 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-21 20:03:54,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:03:54,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640919288] [2023-12-21 20:03:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640919288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:03:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:03:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:03:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125511222] [2023-12-21 20:03:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:03:54,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:03:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:03:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:03:54,155 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:54,172 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2023-12-21 20:03:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:03:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 20:03:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:54,179 INFO L225 Difference]: With dead ends: 30 [2023-12-21 20:03:54,179 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 20:03:54,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:03:54,183 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:54,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:03:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 20:03:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 20:03:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-12-21 20:03:54,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9 [2023-12-21 20:03:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:54,210 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-12-21 20:03:54,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2023-12-21 20:03:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 20:03:54,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:54,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:54,216 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-21 20:03:54,413 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-21 20:03:54,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:54,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1615558018, now seen corresponding path program 1 times [2023-12-21 20:03:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576778860] [2023-12-21 20:03:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:03:54,417 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-21 20:03:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:54,418 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-21 20:03:54,419 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-21 20:03:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:03:54,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 20:03:54,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:54,485 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-21 20:03:54,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:03:54,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576778860] [2023-12-21 20:03:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576778860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:03:54,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:03:54,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:03:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074907064] [2023-12-21 20:03:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:03:54,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 20:03:54,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 20:03:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:54,488 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:54,505 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-21 20:03:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 20:03:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 20:03:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:54,517 INFO L225 Difference]: With dead ends: 27 [2023-12-21 20:03:54,517 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 20:03:54,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:54,518 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:54,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:03:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 20:03:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 20:03:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-21 20:03:54,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2023-12-21 20:03:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:54,522 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-21 20:03:54,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-21 20:03:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 20:03:54,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:54,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:54,529 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-21 20:03:54,725 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-21 20:03:54,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:54,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1084499837, now seen corresponding path program 1 times [2023-12-21 20:03:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234654998] [2023-12-21 20:03:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:03:54,727 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-21 20:03:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:54,728 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-21 20:03:54,768 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-21 20:03:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:03:54,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 20:03:54,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:03:54,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:03:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:03:54,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234654998] [2023-12-21 20:03:54,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234654998] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:03:54,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:03:54,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 20:03:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628766452] [2023-12-21 20:03:54,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:03:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 20:03:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:54,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 20:03:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:03:54,900 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:54,947 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-12-21 20:03:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:03:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 20:03:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:54,948 INFO L225 Difference]: With dead ends: 30 [2023-12-21 20:03:54,948 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 20:03:54,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 20:03:54,949 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:54,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:03:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 20:03:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 20:03:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-21 20:03:54,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-21 20:03:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:54,953 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-21 20:03:54,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-21 20:03:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 20:03:54,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:54,954 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:54,958 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-21 20:03:55,156 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-21 20:03:55,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:55,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash 758338110, now seen corresponding path program 2 times [2023-12-21 20:03:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485525813] [2023-12-21 20:03:55,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:03:55,158 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-21 20:03:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:55,159 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-21 20:03:55,195 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-21 20:03:55,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 20:03:55,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:03:55,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 20:03:55,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:03:55,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:03:55,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485525813] [2023-12-21 20:03:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485525813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:03:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:03:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 20:03:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014608280] [2023-12-21 20:03:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:03:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 20:03:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 20:03:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:55,220 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:55,244 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-21 20:03:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 20:03:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 20:03:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:55,245 INFO L225 Difference]: With dead ends: 36 [2023-12-21 20:03:55,245 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 20:03:55,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:55,247 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:55,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:03:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 20:03:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2023-12-21 20:03:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-21 20:03:55,251 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2023-12-21 20:03:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:55,251 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-21 20:03:55,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-21 20:03:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 20:03:55,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:55,252 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:55,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 20:03:55,468 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-21 20:03:55,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:55,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1279771874, now seen corresponding path program 1 times [2023-12-21 20:03:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57156398] [2023-12-21 20:03:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:03:55,470 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-21 20:03:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:55,472 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-21 20:03:55,473 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-21 20:03:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:03:55,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 20:03:55,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:03:55,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:03:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:03:55,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57156398] [2023-12-21 20:03:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57156398] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:03:55,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:03:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 20:03:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453494468] [2023-12-21 20:03:55,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:03:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 20:03:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 20:03:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 20:03:55,719 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:55,987 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2023-12-21 20:03:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 20:03:55,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-21 20:03:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:55,988 INFO L225 Difference]: With dead ends: 38 [2023-12-21 20:03:55,988 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 20:03:55,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:03:55,989 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:55,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 20:03:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 20:03:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 20:03:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-21 20:03:55,994 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2023-12-21 20:03:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:55,994 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-21 20:03:55,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-21 20:03:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:03:55,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:55,995 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:55,999 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-21 20:03:56,197 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-21 20:03:56,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:56,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -182421182, now seen corresponding path program 2 times [2023-12-21 20:03:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057744995] [2023-12-21 20:03:56,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:03:56,198 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-21 20:03:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:56,200 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-21 20:03:56,214 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-21 20:03:56,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:03:56,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:03:56,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 20:03:56,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:03:56,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:03:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:03:56,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057744995] [2023-12-21 20:03:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057744995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:03:56,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:03:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 20:03:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290302687] [2023-12-21 20:03:56,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:03:56,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:03:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:03:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:03:56,865 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:58,417 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-12-21 20:03:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 20:03:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 20:03:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:58,419 INFO L225 Difference]: With dead ends: 50 [2023-12-21 20:03:58,419 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 20:03:58,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:03:58,420 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:58,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 20:03:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 20:03:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-21 20:03:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-21 20:03:58,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2023-12-21 20:03:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:58,427 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-21 20:03:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-21 20:03:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 20:03:58,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:58,428 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:58,443 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-21 20:03:58,643 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-21 20:03:58,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:58,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 176523778, now seen corresponding path program 3 times [2023-12-21 20:03:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976002591] [2023-12-21 20:03:58,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:03:58,645 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-21 20:03:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:58,647 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-21 20:03:58,681 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-21 20:03:58,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 20:03:58,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:03:58,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 20:03:58,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 20:03:58,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:03:58,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:03:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976002591] [2023-12-21 20:03:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976002591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:03:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:03:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 20:03:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449752016] [2023-12-21 20:03:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:03:58,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 20:03:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:03:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 20:03:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:58,780 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:03:58,803 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-12-21 20:03:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 20:03:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-21 20:03:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:03:58,804 INFO L225 Difference]: With dead ends: 51 [2023-12-21 20:03:58,804 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 20:03:58,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 20:03:58,805 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:03:58,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:03:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 20:03:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-21 20:03:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-12-21 20:03:58,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2023-12-21 20:03:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:03:58,811 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-12-21 20:03:58,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:03:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-12-21 20:03:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 20:03:58,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:03:58,811 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:03:58,816 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-21 20:03:59,012 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-21 20:03:59,012 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:03:59,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:03:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -632822848, now seen corresponding path program 1 times [2023-12-21 20:03:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:03:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436625955] [2023-12-21 20:03:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:03:59,013 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-21 20:03:59,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:03:59,014 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-21 20:03:59,016 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-21 20:03:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:03:59,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 20:03:59,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:03:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:03:59,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:04:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:04:01,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:04:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436625955] [2023-12-21 20:04:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436625955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:04:01,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:04:01,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 20:04:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060438716] [2023-12-21 20:04:01,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:04:01,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 20:04:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:04:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 20:04:01,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 20:04:01,275 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:04:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:04:13,405 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2023-12-21 20:04:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 20:04:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-21 20:04:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:04:13,422 INFO L225 Difference]: With dead ends: 74 [2023-12-21 20:04:13,422 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 20:04:13,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 20:04:13,426 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 20:04:13,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 20:04:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 20:04:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-21 20:04:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:04:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2023-12-21 20:04:13,442 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2023-12-21 20:04:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:04:13,442 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2023-12-21 20:04:13,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:04:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2023-12-21 20:04:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 20:04:13,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:04:13,445 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:04:13,452 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-21 20:04:13,649 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-21 20:04:13,651 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:04:13,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:04:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1303861952, now seen corresponding path program 2 times [2023-12-21 20:04:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:04:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293413258] [2023-12-21 20:04:13,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:04:13,652 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-21 20:04:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:04:13,653 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-21 20:04:13,654 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-21 20:04:13,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:04:13,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:04:13,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-21 20:04:13,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:04:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:04:14,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:04:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:04:21,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:04:21,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293413258] [2023-12-21 20:04:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293413258] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:04:21,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:04:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 20:04:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565331197] [2023-12-21 20:04:21,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:04:21,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 20:04:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:04:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 20:04:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 20:04:21,688 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:06:02,410 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2023-12-21 20:06:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 20:06:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 20:06:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:06:02,411 INFO L225 Difference]: With dead ends: 122 [2023-12-21 20:06:02,411 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 20:06:02,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 106.1s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 20:06:02,415 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:06:02,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-21 20:06:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 20:06:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-21 20:06:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2023-12-21 20:06:02,441 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 58 [2023-12-21 20:06:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:06:02,441 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2023-12-21 20:06:02,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2023-12-21 20:06:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-21 20:06:02,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:06:02,446 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:06:02,455 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-21 20:06:02,649 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-21 20:06:02,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:06:02,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:06:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1717872704, now seen corresponding path program 3 times [2023-12-21 20:06:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:06:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46214338] [2023-12-21 20:06:02,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:06:02,650 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-21 20:06:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:06:02,651 INFO L229 MonitoredProcess]: Starting monitored process 11 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-21 20:06:02,676 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 (11)] Waiting until timeout for monitored process [2023-12-21 20:06:02,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 20:06:02,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:06:02,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 20:06:02,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:06:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4466 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 20:06:02,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:06:02,958 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-12-21 20:06:02,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2023-12-21 20:06:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4466 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 20:06:02,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:06:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46214338] [2023-12-21 20:06:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46214338] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:06:02,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:06:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-21 20:06:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340675462] [2023-12-21 20:06:02,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:06:02,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 20:06:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:06:02,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 20:06:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 20:06:02,984 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:06:03,137 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-12-21 20:06:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 20:06:03,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-21 20:06:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:06:03,143 INFO L225 Difference]: With dead ends: 118 [2023-12-21 20:06:03,143 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 20:06:03,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:06:03,144 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:06:03,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 20:06:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 20:06:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-12-21 20:06:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2023-12-21 20:06:03,182 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 106 [2023-12-21 20:06:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:06:03,183 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2023-12-21 20:06:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:06:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2023-12-21 20:06:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 20:06:03,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:06:03,185 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:06:03,189 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 (11)] Forceful destruction successful, exit code 0 [2023-12-21 20:06:03,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-21 20:06:03,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:06:03,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:06:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1331058281, now seen corresponding path program 1 times [2023-12-21 20:06:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:06:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526578453] [2023-12-21 20:06:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:06:03,387 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-21 20:06:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:06:03,388 INFO L229 MonitoredProcess]: Starting monitored process 12 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-21 20:06:03,392 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 (12)] Waiting until timeout for monitored process [2023-12-21 20:06:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:06:03,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-21 20:06:03,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:06:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4468 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:06:07,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:06:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4468 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:06:36,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:06:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526578453] [2023-12-21 20:06:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526578453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:06:36,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:06:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 20:06:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397671147] [2023-12-21 20:06:36,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:06:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 20:06:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:06:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 20:06:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 20:06:36,358 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 192 states, 192 states have (on average 1.0625) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:07:07,558 WARN L293 SmtUtils]: Spent 20.94s on a formula simplification that was a NOOP. DAG size: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:07:33,048 WARN L293 SmtUtils]: Spent 20.03s on a formula simplification that was a NOOP. DAG size: 283 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:07:55,092 WARN L293 SmtUtils]: Spent 16.53s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:08:21,207 WARN L293 SmtUtils]: Spent 21.20s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:08:45,638 WARN L293 SmtUtils]: Spent 18.74s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:09:07,281 WARN L293 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 271 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:09:32,075 WARN L293 SmtUtils]: Spent 19.98s on a formula simplification that was a NOOP. DAG size: 268 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:09:54,638 WARN L293 SmtUtils]: Spent 17.13s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:10:17,273 WARN L293 SmtUtils]: Spent 17.26s on a formula simplification that was a NOOP. DAG size: 262 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:10:38,902 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:10:58,983 WARN L293 SmtUtils]: Spent 14.92s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:11:21,380 WARN L293 SmtUtils]: Spent 17.28s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:11:43,535 WARN L293 SmtUtils]: Spent 16.39s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:12:05,238 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:12:23,642 WARN L293 SmtUtils]: Spent 13.33s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:12:43,380 WARN L293 SmtUtils]: Spent 14.01s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:13:03,428 WARN L293 SmtUtils]: Spent 14.54s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:13:22,410 WARN L293 SmtUtils]: Spent 13.40s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:13:26,549 WARN L876 $PredicateComparison]: unable to prove that (and (bvslt (bvadd (_ bv34 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv66 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv56 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv7 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv37 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv23 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv59 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv41 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt |c_ULTIMATE.start_init_~i~0#1| |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv8 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv58 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv63 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv74 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv57 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv14 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv5 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv72 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv45 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv53 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv52 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv33 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv65 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv69 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv27 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv13 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv38 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv61 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv1 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv11 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv67 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv55 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv36 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv76 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv49 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv28 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv25 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv71 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv51 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv6 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv54 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv46 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv15 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv31 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv43 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv9 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv75 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv32 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv39 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv24 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv42 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv19 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv22 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv20 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv26 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv64 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv21 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv12 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv29 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv48 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv70 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv17 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv47 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv44 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv50 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv73 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv30 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv60 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv10 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv16 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv68 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd |c_ULTIMATE.start_init_~i~0#1| (_ bv40 32)) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv35 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv62 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|) (bvslt (bvadd (_ bv18 32) |c_ULTIMATE.start_init_~i~0#1|) |c_ULTIMATE.start_init_~size#1|)) is different from true [2023-12-21 20:13:45,904 WARN L293 SmtUtils]: Spent 13.95s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:14:04,555 WARN L293 SmtUtils]: Spent 12.93s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:14:22,316 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:14:37,469 WARN L293 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:14:52,298 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:15:06,654 WARN L293 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:15:20,560 WARN L293 SmtUtils]: Spent 9.12s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:15:34,707 WARN L293 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:15:49,930 WARN L293 SmtUtils]: Spent 9.83s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:16:05,470 WARN L293 SmtUtils]: Spent 9.87s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:16:18,914 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:16:33,101 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:16:47,083 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:16:59,533 WARN L293 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:17:11,562 WARN L293 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:17:24,913 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:17:36,007 WARN L293 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:17:47,536 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:17:59,048 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:18:10,498 WARN L293 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:18:21,152 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:18:31,611 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 20:18:36,471 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-21 20:18:36,478 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:18:37,488 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 (12)] Forceful destruction successful, exit code 0 [2023-12-21 20:18:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2023-12-21 20:18:37,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 739.6s TimeCoverageRelationStatistics Valid=17066, Invalid=36529, Unknown=1, NotChecked=460, Total=54056 [2023-12-21 20:18:37,511 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:18:37,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9162 Invalid, 0 Unknown, 115 Unchecked, 7.3s Time] [2023-12-21 20:18:37,512 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:18:37,512 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 138 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 20:18:37,516 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1] [2023-12-21 20:18:37,517 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:18:37,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:18:37 BoogieIcfgContainer [2023-12-21 20:18:37,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:18:37,519 INFO L158 Benchmark]: Toolchain (without parser) took 884026.36ms. Allocated memory was 309.3MB in the beginning and 400.6MB in the end (delta: 91.2MB). Free memory was 256.6MB in the beginning and 133.4MB in the end (delta: 123.1MB). Peak memory consumption was 215.3MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,519 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:18:37,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.23ms. Allocated memory is still 309.3MB. Free memory was 256.6MB in the beginning and 245.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.97ms. Allocated memory is still 309.3MB. Free memory was 245.0MB in the beginning and 243.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,520 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 309.3MB. Free memory was 243.6MB in the beginning and 241.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,532 INFO L158 Benchmark]: RCFGBuilder took 225.84ms. Allocated memory is still 309.3MB. Free memory was 241.5MB in the beginning and 227.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,533 INFO L158 Benchmark]: TraceAbstraction took 883541.11ms. Allocated memory was 309.3MB in the beginning and 400.6MB in the end (delta: 91.2MB). Free memory was 227.2MB in the beginning and 133.4MB in the end (delta: 93.8MB). Peak memory consumption was 185.9MB. Max. memory is 8.0GB. [2023-12-21 20:18:37,534 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.14ms. Allocated memory is still 169.9MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.23ms. Allocated memory is still 309.3MB. Free memory was 256.6MB in the beginning and 245.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.97ms. Allocated memory is still 309.3MB. Free memory was 245.0MB in the beginning and 243.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 309.3MB. Free memory was 243.6MB in the beginning and 241.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 225.84ms. Allocated memory is still 309.3MB. Free memory was 241.5MB in the beginning and 227.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 883541.11ms. Allocated memory was 309.3MB in the beginning and 400.6MB in the end (delta: 91.2MB). Free memory was 227.2MB in the beginning and 133.4MB in the end (delta: 93.8MB). Peak memory consumption was 185.9MB. 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: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 138 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.5s, OverallIterations: 11, TraceHistogramMax: 94, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 836.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 1488 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 115 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12508 IncrementalHoareTripleChecker+Invalid, 12633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 149 mSDtfsCounter, 12508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 885 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 505 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 861.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 43.9s InterpolantComputationTime, 420 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 757 ConstructedInterpolants, 0 QuantifiedInterpolants, 2697 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1346 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 9208/20940 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