/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/loops/sum_array-2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:25:44,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:25:44,971 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-16 16:25:44,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:25:44,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:25:44,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:25:44,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:25:44,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:25:44,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:25:44,995 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:25:44,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:25:45,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:25:45,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:25:45,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:25:45,005 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:25:45,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:25:45,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:25:45,007 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:25:45,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:25:45,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:25:45,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:25:45,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:25:45,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:25:45,010 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:25:45,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:25:45,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:25:45,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:25:45,012 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:25:45,012 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-16 16:25:45,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:25:45,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:25:45,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:25:45,208 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:25:45,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:25:45,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2-2.i [2023-12-16 16:25:46,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:25:46,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:25:46,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2-2.i [2023-12-16 16:25:46,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f074ccd/22081fef76b54ff9a950d649f402a6d8/FLAGd72fe49df [2023-12-16 16:25:46,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f074ccd/22081fef76b54ff9a950d649f402a6d8 [2023-12-16 16:25:46,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:25:46,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:25:46,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:25:46,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:25:46,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:25:46,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ffc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46, skipping insertion in model container [2023-12-16 16:25:46,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:25:46,561 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2-2.i[940,953] [2023-12-16 16:25:46,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:25:46,582 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:25:46,593 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2-2.i[940,953] [2023-12-16 16:25:46,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:25:46,614 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:25:46,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46 WrapperNode [2023-12-16 16:25:46,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:25:46,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:25:46,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:25:46,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:25:46,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,642 INFO L138 Inliner]: procedures = 20, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2023-12-16 16:25:46,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:25:46,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:25:46,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:25:46,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:25:46,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,663 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-12-16 16:25:46,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:25:46,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:25:46,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:25:46,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:25:46,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (1/1) ... [2023-12-16 16:25:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:25:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:25:46,716 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-16 16:25:46,733 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-16 16:25:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:25:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:25:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:25:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:25:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 16:25:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:25:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:25:46,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:25:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 16:25:46,827 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:25:46,829 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:25:47,001 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:25:47,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:25:47,039 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 16:25:47,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:47 BoogieIcfgContainer [2023-12-16 16:25:47,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:25:47,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:25:47,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:25:47,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:25:47,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:25:46" (1/3) ... [2023-12-16 16:25:47,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:47, skipping insertion in model container [2023-12-16 16:25:47,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:46" (2/3) ... [2023-12-16 16:25:47,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:47, skipping insertion in model container [2023-12-16 16:25:47,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:47" (3/3) ... [2023-12-16 16:25:47,047 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array-2-2.i [2023-12-16 16:25:47,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:25:47,062 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:25:47,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:25:47,101 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;@33823ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:25:47,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:25:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 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-16 16:25:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:25:47,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:47,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:47,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:47,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -672135389, now seen corresponding path program 1 times [2023-12-16 16:25:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085877623] [2023-12-16 16:25:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:47,127 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-16 16:25:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:47,129 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-16 16:25:47,132 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-16 16:25:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:47,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:25:47,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:47,204 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-16 16:25:47,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:47,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:47,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085877623] [2023-12-16 16:25:47,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085877623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:47,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:25:47,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029656140] [2023-12-16 16:25:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:47,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:25:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:25:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:25:47,228 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:47,249 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2023-12-16 16:25:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:25:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 16:25:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:47,256 INFO L225 Difference]: With dead ends: 35 [2023-12-16 16:25:47,256 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 16:25:47,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-16 16:25:47,260 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:47,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 16:25:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 16:25:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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-16 16:25:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-16 16:25:47,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2023-12-16 16:25:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:47,280 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-16 16:25:47,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-16 16:25:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:25:47,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:47,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:47,285 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-16 16:25:47,483 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-16 16:25:47,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:47,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash -677676515, now seen corresponding path program 1 times [2023-12-16 16:25:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598569355] [2023-12-16 16:25:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:47,487 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-16 16:25:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:47,505 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-16 16:25:47,517 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-16 16:25:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:47,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:25:47,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:47,674 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-16 16:25:47,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:47,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598569355] [2023-12-16 16:25:47,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598569355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:47,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:25:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349637495] [2023-12-16 16:25:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:47,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:25:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:25:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:25:47,681 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:47,772 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-16 16:25:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:25:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 16:25:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:47,774 INFO L225 Difference]: With dead ends: 37 [2023-12-16 16:25:47,774 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 16:25:47,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:25:47,776 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:47,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:25:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 16:25:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-12-16 16:25:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-16 16:25:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-16 16:25:47,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2023-12-16 16:25:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:47,784 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-16 16:25:47,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-16 16:25:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 16:25:47,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:47,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:47,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:47,987 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-16 16:25:47,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:47,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -286040439, now seen corresponding path program 1 times [2023-12-16 16:25:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097782225] [2023-12-16 16:25:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:47,991 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-16 16:25:47,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:47,992 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-16 16:25:47,996 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-16 16:25:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:48,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:25:48,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:48,112 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-16 16:25:48,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:25:48,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097782225] [2023-12-16 16:25:48,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097782225] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 16:25:48,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 16:25:48,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-12-16 16:25:48,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669613096] [2023-12-16 16:25:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:48,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:25:48,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:48,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:25:48,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:25:48,162 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:48,214 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-12-16 16:25:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:25:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 16:25:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:48,217 INFO L225 Difference]: With dead ends: 29 [2023-12-16 16:25:48,217 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 16:25:48,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:25:48,221 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:48,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 16:25:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-12-16 16:25:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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-16 16:25:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-16 16:25:48,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2023-12-16 16:25:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:48,228 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-16 16:25:48,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-16 16:25:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:25:48,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:48,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:48,232 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-16 16:25:48,432 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-16 16:25:48,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:48,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2038407239, now seen corresponding path program 1 times [2023-12-16 16:25:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:48,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839673211] [2023-12-16 16:25:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:48,435 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-16 16:25:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:48,436 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-16 16:25:48,441 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-16 16:25:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:48,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 16:25:48,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:25:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:25:49,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:49,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-12-16 16:25:49,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-12-16 16:25:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:25:53,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839673211] [2023-12-16 16:25:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839673211] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:53,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:53,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2023-12-16 16:25:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253840882] [2023-12-16 16:25:53,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:53,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:25:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:25:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:25:53,420 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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-16 16:25:57,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:02,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:02,323 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-12-16 16:26:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 16:26:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 18 [2023-12-16 16:26:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:02,325 INFO L225 Difference]: With dead ends: 74 [2023-12-16 16:26:02,325 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 16:26:02,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2023-12-16 16:26:02,326 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:02,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 101 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-16 16:26:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 16:26:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2023-12-16 16:26:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-16 16:26:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-12-16 16:26:02,334 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2023-12-16 16:26:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:02,334 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-12-16 16:26:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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-16 16:26:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-12-16 16:26:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:26:02,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:02,334 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:02,360 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-16 16:26:02,537 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-16 16:26:02,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:02,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash -347310693, now seen corresponding path program 1 times [2023-12-16 16:26:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225958415] [2023-12-16 16:26:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:02,538 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-16 16:26:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:02,542 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-16 16:26:02,543 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-16 16:26:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:02,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:26:02,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:26:02,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:26:02,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225958415] [2023-12-16 16:26:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225958415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:02,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:02,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:26:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197765067] [2023-12-16 16:26:02,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:26:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:26:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:26:02,844 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-16 16:26:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:03,151 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-12-16 16:26:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:26:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 21 [2023-12-16 16:26:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:03,152 INFO L225 Difference]: With dead ends: 69 [2023-12-16 16:26:03,152 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:26:03,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:26:03,153 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:03,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:26:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:26:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-12-16 16:26:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 16:26:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-16 16:26:03,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2023-12-16 16:26:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:03,157 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-16 16:26:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-16 16:26:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-16 16:26:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:26:03,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:03,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:03,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 16:26:03,358 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-16 16:26:03,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:03,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1296099805, now seen corresponding path program 2 times [2023-12-16 16:26:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835774552] [2023-12-16 16:26:03,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:26:03,360 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-16 16:26:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:03,362 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-16 16:26:03,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:26:03,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:26:03,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:03,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 16:26:03,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:03,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:26:03,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:03,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 16:26:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:26:04,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-16 16:26:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:04,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:04,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-12-16 16:26:04,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 120 [2023-12-16 16:26:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:26:04,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835774552] [2023-12-16 16:26:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835774552] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:04,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2023-12-16 16:26:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067785599] [2023-12-16 16:26:04,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:04,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:26:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:26:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:26:04,523 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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-16 16:26:09,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:13,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:13,955 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2023-12-16 16:26:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-16 16:26:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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 25 [2023-12-16 16:26:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:13,956 INFO L225 Difference]: With dead ends: 113 [2023-12-16 16:26:13,956 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 16:26:13,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 16:26:13,957 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 141 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:13,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 102 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 322 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2023-12-16 16:26:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 16:26:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 46. [2023-12-16 16:26:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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-16 16:26:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-12-16 16:26:13,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2023-12-16 16:26:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:13,965 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-12-16 16:26:13,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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-16 16:26:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-12-16 16:26:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:26:13,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:13,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:13,971 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-16 16:26:14,167 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-16 16:26:14,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:14,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 358530117, now seen corresponding path program 2 times [2023-12-16 16:26:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:14,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324125484] [2023-12-16 16:26:14,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:26:14,168 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-16 16:26:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:14,243 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-16 16:26:14,245 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-16 16:26:14,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:26:14,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:14,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 16:26:14,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:14,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:26:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:15,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:15,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-12-16 16:26:15,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-16 16:26:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:26:15,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324125484] [2023-12-16 16:26:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324125484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:15,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:15,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2023-12-16 16:26:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233982344] [2023-12-16 16:26:15,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:15,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 16:26:15,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 16:26:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:26:15,503 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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-16 16:26:20,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:24,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:24,814 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-12-16 16:26:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-16 16:26:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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 28 [2023-12-16 16:26:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:24,817 INFO L225 Difference]: With dead ends: 100 [2023-12-16 16:26:24,820 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 16:26:24,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2023-12-16 16:26:24,825 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 95 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:24,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 133 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 345 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2023-12-16 16:26:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 16:26:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 49. [2023-12-16 16:26:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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-16 16:26:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-12-16 16:26:24,837 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 28 [2023-12-16 16:26:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:24,837 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-12-16 16:26:24,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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-16 16:26:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-12-16 16:26:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:26:24,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:24,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:24,844 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-16 16:26:25,048 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-16 16:26:25,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:25,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash 620799934, now seen corresponding path program 3 times [2023-12-16 16:26:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404669121] [2023-12-16 16:26:25,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:26:25,051 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-16 16:26:25,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:25,052 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-16 16:26:25,054 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-16 16:26:25,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 16:26:25,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:25,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:26:25,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:26:25,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:26:25,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404669121] [2023-12-16 16:26:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404669121] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:25,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-16 16:26:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907788476] [2023-12-16 16:26:25,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:26:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:26:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:26:25,512 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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-16 16:26:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:25,847 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2023-12-16 16:26:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:26:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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 29 [2023-12-16 16:26:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:25,849 INFO L225 Difference]: With dead ends: 97 [2023-12-16 16:26:25,849 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 16:26:25,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:26:25,849 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 122 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:25,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 79 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:26:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 16:26:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2023-12-16 16:26:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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-16 16:26:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-12-16 16:26:25,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 29 [2023-12-16 16:26:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:25,854 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-12-16 16:26:25,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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-16 16:26:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-12-16 16:26:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:26:25,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:25,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:25,874 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:26:26,055 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-16 16:26:26,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:26,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:26,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1875794823, now seen corresponding path program 4 times [2023-12-16 16:26:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:26,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433566790] [2023-12-16 16:26:26,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:26:26,056 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-16 16:26:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:26,057 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-16 16:26:26,058 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-16 16:26:26,199 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:26:26,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:26,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 16:26:26,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:26,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 16:26:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:26,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:26,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:26:26,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:26,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 16:26:26,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:26:26,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-16 16:26:26,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-16 16:26:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:27,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:27,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2023-12-16 16:26:27,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1022 treesize of output 1014 [2023-12-16 16:26:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 16:26:27,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433566790] [2023-12-16 16:26:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433566790] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:27,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2023-12-16 16:26:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093627321] [2023-12-16 16:26:27,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:27,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 16:26:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:27,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 16:26:27,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-12-16 16:26:27,467 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 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-16 16:26:32,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:36,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:37,492 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2023-12-16 16:26:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-16 16:26:37,492 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 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 32 [2023-12-16 16:26:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:37,493 INFO L225 Difference]: With dead ends: 154 [2023-12-16 16:26:37,493 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 16:26:37,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=445, Invalid=2207, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 16:26:37,494 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 201 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:37,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 123 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 402 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-16 16:26:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 16:26:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 57. [2023-12-16 16:26:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 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-16 16:26:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2023-12-16 16:26:37,502 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 32 [2023-12-16 16:26:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:37,502 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2023-12-16 16:26:37,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 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-16 16:26:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2023-12-16 16:26:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 16:26:37,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:37,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:37,514 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-16 16:26:37,703 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-16 16:26:37,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:37,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -10685861, now seen corresponding path program 3 times [2023-12-16 16:26:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284283152] [2023-12-16 16:26:37,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:26:37,705 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-16 16:26:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:37,725 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-16 16:26:37,750 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-16 16:26:37,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 16:26:37,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:37,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 16:26:37,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:38,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:26:38,170 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-12-16 16:26:38,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-16 16:26:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-16 16:26:38,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:50,818 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-16 16:26:50,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:26:50,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 84 [2023-12-16 16:26:51,081 INFO L349 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2023-12-16 16:26:51,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 52 [2023-12-16 16:26:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 16:26:51,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284283152] [2023-12-16 16:26:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284283152] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:51,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:26:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477736259] [2023-12-16 16:26:51,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:51,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:26:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:26:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=1, NotChecked=0, Total=240 [2023-12-16 16:26:51,154 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-16 16:26:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:51,619 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2023-12-16 16:26:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:26:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 35 [2023-12-16 16:26:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:51,620 INFO L225 Difference]: With dead ends: 67 [2023-12-16 16:26:51,620 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 16:26:51,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=100, Invalid=319, Unknown=1, NotChecked=0, Total=420 [2023-12-16 16:26:51,621 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:51,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 33 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:26:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 16:26:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-12-16 16:26:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 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-16 16:26:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-12-16 16:26:51,631 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 35 [2023-12-16 16:26:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:51,631 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-12-16 16:26:51,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-16 16:26:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-12-16 16:26:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 16:26:51,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:51,632 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:51,636 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 (11)] Ended with exit code 0 [2023-12-16 16:26:51,835 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-16 16:26:51,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:51,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash 917881004, now seen corresponding path program 5 times [2023-12-16 16:26:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:51,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689383739] [2023-12-16 16:26:51,836 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:26:51,837 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-16 16:26:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:51,837 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-16 16:26:51,860 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-16 16:26:52,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-16 16:26:52,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:52,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:26:52,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:26:52,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:26:52,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689383739] [2023-12-16 16:26:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689383739] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:52,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-12-16 16:26:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660262331] [2023-12-16 16:26:52,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:52,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-16 16:26:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-16 16:26:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:26:52,637 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 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-16 16:26:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:53,334 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2023-12-16 16:26:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:26:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 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 36 [2023-12-16 16:26:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:53,335 INFO L225 Difference]: With dead ends: 126 [2023-12-16 16:26:53,335 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 16:26:53,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2023-12-16 16:26:53,336 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 138 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:53,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 139 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:26:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 16:26:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2023-12-16 16:26:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 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-16 16:26:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-12-16 16:26:53,347 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 36 [2023-12-16 16:26:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:53,347 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-12-16 16:26:53,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 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-16 16:26:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-12-16 16:26:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:53,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:53,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:53,356 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 (12)] Ended with exit code 0 [2023-12-16 16:26:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-16 16:26:53,555 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:53,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -509674745, now seen corresponding path program 4 times [2023-12-16 16:26:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225731963] [2023-12-16 16:26:53,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:26:53,556 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-16 16:26:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:53,558 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 16:26:53,587 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 (13)] Waiting until timeout for monitored process [2023-12-16 16:26:53,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:26:53,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:53,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 16:26:53,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:54,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:26:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:54,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:55,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-12-16 16:26:55,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-16 16:26:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 16:26:59,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225731963] [2023-12-16 16:26:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225731963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:59,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 30 [2023-12-16 16:26:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009863582] [2023-12-16 16:26:59,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:59,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 16:26:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 16:26:59,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2023-12-16 16:26:59,300 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 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-16 16:27:04,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-16 16:27:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-16 16:27:04,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 16:27:04,494 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:27:04,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 544 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-16 16:27:04,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:27:04,505 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 16:27:04,515 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-16 16:27:04,515 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:27:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 16:27:04,696 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (70states) and FLOYD_HOARE automaton (currently 34 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. [2023-12-16 16:27:04,700 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1] [2023-12-16 16:27:04,702 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:27:04,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:27:04 BoogieIcfgContainer [2023-12-16 16:27:04,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:27:04,706 INFO L158 Benchmark]: Toolchain (without parser) took 78291.14ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 138.6MB in the beginning and 78.9MB in the end (delta: 59.6MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,707 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:27:04,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 126.7MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.97ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 125.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,708 INFO L158 Benchmark]: Boogie Preprocessor took 38.04ms. Allocated memory is still 184.5MB. Free memory was 125.1MB in the beginning and 122.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,708 INFO L158 Benchmark]: RCFGBuilder took 357.84ms. Allocated memory is still 184.5MB. Free memory was 122.6MB in the beginning and 106.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,708 INFO L158 Benchmark]: TraceAbstraction took 77664.10ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 106.2MB in the beginning and 78.9MB in the end (delta: 27.3MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2023-12-16 16:27:04,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 126.7MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.97ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 125.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.04ms. Allocated memory is still 184.5MB. Free memory was 125.1MB in the beginning and 122.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 357.84ms. Allocated memory is still 184.5MB. Free memory was 122.6MB in the beginning and 106.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 77664.10ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 106.2MB in the beginning and 78.9MB in the end (delta: 27.3MB). Peak memory consumption was 103.4MB. 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: 20]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20). Cancelled while NwaCegarLoop was constructing difference of abstraction (70states) and FLOYD_HOARE automaton (currently 34 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.6s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 40.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 893 SdHoareTripleChecker+Invalid, 40.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 744 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3261 IncrementalHoareTripleChecker+Invalid, 3635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 149 mSDtfsCounter, 3261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=11, InterpolantAutomatonStates: 217, 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, 11 MinimizatonAttempts, 315 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 552 ConstructedInterpolants, 4 QuantifiedInterpolants, 7236 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 195/406 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