/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 15:27:29,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 15:27:30,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 15:27:30,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 15:27:30,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 15:27:30,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 15:27:30,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 15:27:30,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 15:27:30,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 15:27:30,090 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 15:27:30,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 15:27:30,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 15:27:30,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 15:27:30,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 15:27:30,092 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 15:27:30,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 15:27:30,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 15:27:30,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 15:27:30,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 15:27:30,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 15:27:30,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 15:27:30,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 15:27:30,095 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 15:27:30,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 15:27:30,096 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 15:27:30,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 15:27:30,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 15:27:30,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 15:27:30,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 15:27:30,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 15:27:30,099 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 15:27:30,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 15:27:30,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 15:27:30,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 15:27:30,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 15:27:30,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 15:27:30,322 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 15:27:30,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2023-12-21 15:27:31,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 15:27:31,556 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 15:27:31,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2023-12-21 15:27:31,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc2527b3/4caa30f941c4464a9aa4ab4f1dd6238b/FLAGbc29cd927 [2023-12-21 15:27:31,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc2527b3/4caa30f941c4464a9aa4ab4f1dd6238b [2023-12-21 15:27:31,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 15:27:31,575 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 15:27:31,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 15:27:31,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 15:27:31,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 15:27:31,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c693cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31, skipping insertion in model container [2023-12-21 15:27:31,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 15:27:31,714 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i[823,836] [2023-12-21 15:27:31,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 15:27:31,741 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 15:27:31,749 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i[823,836] [2023-12-21 15:27:31,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 15:27:31,774 INFO L206 MainTranslator]: Completed translation [2023-12-21 15:27:31,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31 WrapperNode [2023-12-21 15:27:31,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 15:27:31,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 15:27:31,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 15:27:31,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 15:27:31,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,799 INFO L138 Inliner]: procedures = 18, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2023-12-21 15:27:31,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 15:27:31,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 15:27:31,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 15:27:31,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 15:27:31,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,823 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2023-12-21 15:27:31,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 15:27:31,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 15:27:31,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 15:27:31,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 15:27:31,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (1/1) ... [2023-12-21 15:27:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 15:27:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 15:27:31,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 15:27:31,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 15:27:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 15:27:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 15:27:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 15:27:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 15:27:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 15:27:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 15:27:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 15:27:31,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 15:27:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 15:27:31,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 15:27:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 15:27:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 15:27:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 15:27:31,997 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 15:27:31,999 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 15:27:32,210 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 15:27:32,233 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 15:27:32,233 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-21 15:27:32,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:27:32 BoogieIcfgContainer [2023-12-21 15:27:32,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 15:27:32,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 15:27:32,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 15:27:32,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 15:27:32,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:27:31" (1/3) ... [2023-12-21 15:27:32,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337270da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:27:32, skipping insertion in model container [2023-12-21 15:27:32,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:31" (2/3) ... [2023-12-21 15:27:32,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337270da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:27:32, skipping insertion in model container [2023-12-21 15:27:32,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:27:32" (3/3) ... [2023-12-21 15:27:32,239 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2023-12-21 15:27:32,251 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 15:27:32,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 15:27:32,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 15:27:32,286 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;@11868039, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 15:27:32,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 15:27:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 15:27:32,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:32,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:32,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:32,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2038256253, now seen corresponding path program 1 times [2023-12-21 15:27:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594382454] [2023-12-21 15:27:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:32,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:32,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 15:27:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:32,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 15:27:32,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:32,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:32,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594382454] [2023-12-21 15:27:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594382454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 15:27:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880743399] [2023-12-21 15:27:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 15:27:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 15:27:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 15:27:32,453 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:32,487 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2023-12-21 15:27:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 15:27:32,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-21 15:27:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:32,493 INFO L225 Difference]: With dead ends: 64 [2023-12-21 15:27:32,493 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 15:27:32,496 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-21 15:27:32,499 INFO L413 NwaCegarLoop]: 38 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, 38 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-21 15:27:32,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 15:27:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 15:27:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-12-21 15:27:32,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2023-12-21 15:27:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:32,528 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-12-21 15:27:32,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-12-21 15:27:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 15:27:32,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:32,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:32,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 15:27:32,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:32,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:32,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1919310343, now seen corresponding path program 1 times [2023-12-21 15:27:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368643010] [2023-12-21 15:27:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:32,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:32,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:32,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 15:27:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:32,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 15:27:32,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:32,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:32,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:32,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368643010] [2023-12-21 15:27:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368643010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:32,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:32,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 15:27:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487608077] [2023-12-21 15:27:32,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:32,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 15:27:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 15:27:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:32,783 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:32,800 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2023-12-21 15:27:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 15:27:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-21 15:27:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:32,801 INFO L225 Difference]: With dead ends: 61 [2023-12-21 15:27:32,801 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 15:27:32,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:32,803 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:32,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 15:27:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 15:27:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-12-21 15:27:32,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 11 [2023-12-21 15:27:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:32,808 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-12-21 15:27:32,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-12-21 15:27:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 15:27:32,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:32,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:32,819 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-21 15:27:33,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:33,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash -929420434, now seen corresponding path program 1 times [2023-12-21 15:27:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979393239] [2023-12-21 15:27:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:33,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:33,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:33,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 15:27:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:33,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:33,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:33,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:33,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979393239] [2023-12-21 15:27:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979393239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:33,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 15:27:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670012781] [2023-12-21 15:27:33,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 15:27:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 15:27:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 15:27:33,116 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:33,156 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2023-12-21 15:27:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 15:27:33,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 15:27:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:33,157 INFO L225 Difference]: With dead ends: 64 [2023-12-21 15:27:33,158 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 15:27:33,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 15:27:33,159 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:33,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 15:27:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-21 15:27:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-12-21 15:27:33,164 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 12 [2023-12-21 15:27:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:33,164 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-12-21 15:27:33,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-12-21 15:27:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 15:27:33,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:33,165 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:33,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-21 15:27:33,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:33,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1233320903, now seen corresponding path program 2 times [2023-12-21 15:27:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702498858] [2023-12-21 15:27:33,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:33,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:33,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 15:27:33,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:33,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:33,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 15:27:33,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 15:27:33,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:33,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702498858] [2023-12-21 15:27:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702498858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 15:27:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214939034] [2023-12-21 15:27:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:33,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 15:27:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 15:27:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:33,472 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:33,538 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2023-12-21 15:27:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 15:27:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 15:27:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:33,540 INFO L225 Difference]: With dead ends: 63 [2023-12-21 15:27:33,540 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 15:27:33,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:33,543 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:33,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 15:27:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2023-12-21 15:27:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2023-12-21 15:27:33,550 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 15 [2023-12-21 15:27:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:33,550 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2023-12-21 15:27:33,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2023-12-21 15:27:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 15:27:33,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:33,551 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:33,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 15:27:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:33,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1261296920, now seen corresponding path program 1 times [2023-12-21 15:27:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434767926] [2023-12-21 15:27:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:33,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:33,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:33,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 15:27:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:33,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 15:27:33,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:33,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:33,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434767926] [2023-12-21 15:27:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434767926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:33,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 15:27:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337361483] [2023-12-21 15:27:33,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 15:27:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 15:27:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 15:27:33,948 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:34,140 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2023-12-21 15:27:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 15:27:34,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-21 15:27:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:34,141 INFO L225 Difference]: With dead ends: 72 [2023-12-21 15:27:34,141 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 15:27:34,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 15:27:34,142 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:34,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 15:27:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-21 15:27:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-12-21 15:27:34,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 17 [2023-12-21 15:27:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:34,150 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-12-21 15:27:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-12-21 15:27:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 15:27:34,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:34,151 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:34,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 15:27:34,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:34,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:34,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1269696904, now seen corresponding path program 2 times [2023-12-21 15:27:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168666611] [2023-12-21 15:27:34,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:34,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:34,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 15:27:34,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:34,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:34,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:34,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-21 15:27:34,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:34,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168666611] [2023-12-21 15:27:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168666611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 15:27:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802860396] [2023-12-21 15:27:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:34,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 15:27:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 15:27:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 15:27:34,414 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:34,484 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2023-12-21 15:27:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 15:27:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-21 15:27:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:34,488 INFO L225 Difference]: With dead ends: 88 [2023-12-21 15:27:34,488 INFO L226 Difference]: Without dead ends: 60 [2023-12-21 15:27:34,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-21 15:27:34,492 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:34,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 71 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-21 15:27:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2023-12-21 15:27:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2023-12-21 15:27:34,500 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 23 [2023-12-21 15:27:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:34,500 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2023-12-21 15:27:34,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2023-12-21 15:27:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 15:27:34,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:34,501 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:34,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 15:27:34,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:34,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:34,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1044864596, now seen corresponding path program 1 times [2023-12-21 15:27:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036848884] [2023-12-21 15:27:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:34,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:34,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:34,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:34,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 15:27:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:34,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 15:27:34,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:34,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:35,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036848884] [2023-12-21 15:27:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036848884] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:35,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:35,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 15:27:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151089080] [2023-12-21 15:27:35,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:35,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 15:27:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:35,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 15:27:35,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 15:27:35,140 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:35,969 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2023-12-21 15:27:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 15:27:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-21 15:27:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:35,970 INFO L225 Difference]: With dead ends: 86 [2023-12-21 15:27:35,970 INFO L226 Difference]: Without dead ends: 55 [2023-12-21 15:27:35,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 15:27:35,971 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 15:27:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-21 15:27:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-21 15:27:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-12-21 15:27:35,976 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 26 [2023-12-21 15:27:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:35,976 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-12-21 15:27:35,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-12-21 15:27:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 15:27:35,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:35,977 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:35,986 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 (8)] Ended with exit code 0 [2023-12-21 15:27:36,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:36,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:36,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1469772052, now seen corresponding path program 2 times [2023-12-21 15:27:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353412544] [2023-12-21 15:27:36,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:36,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:36,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:36,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:36,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 15:27:36,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:36,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:36,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:36,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2023-12-21 15:27:36,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:36,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353412544] [2023-12-21 15:27:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353412544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:36,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 15:27:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649866751] [2023-12-21 15:27:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:36,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 15:27:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 15:27:36,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 15:27:36,325 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:36,386 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2023-12-21 15:27:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 15:27:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-21 15:27:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:36,387 INFO L225 Difference]: With dead ends: 97 [2023-12-21 15:27:36,387 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 15:27:36,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 15:27:36,388 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:36,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 15:27:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2023-12-21 15:27:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2023-12-21 15:27:36,395 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 38 [2023-12-21 15:27:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:36,396 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-12-21 15:27:36,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2023-12-21 15:27:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-21 15:27:36,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:36,397 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:36,402 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-21 15:27:36,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:36,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:36,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1131393921, now seen corresponding path program 1 times [2023-12-21 15:27:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:36,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357863555] [2023-12-21 15:27:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:36,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:36,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 15:27:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:36,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 15:27:36,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:36,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:38,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357863555] [2023-12-21 15:27:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357863555] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:38,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 15:27:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411516001] [2023-12-21 15:27:38,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:38,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 15:27:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 15:27:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 15:27:38,438 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 48 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 47 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:44,008 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2023-12-21 15:27:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 15:27:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 47 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-21 15:27:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:44,009 INFO L225 Difference]: With dead ends: 126 [2023-12-21 15:27:44,009 INFO L226 Difference]: Without dead ends: 87 [2023-12-21 15:27:44,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 15:27:44,011 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:44,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 842 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 15:27:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-21 15:27:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-21 15:27:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 82 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 15:27:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2023-12-21 15:27:44,020 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 39 [2023-12-21 15:27:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:44,020 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2023-12-21 15:27:44,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 47 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2023-12-21 15:27:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-21 15:27:44,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:44,021 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:44,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 15:27:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:44,228 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:44,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1522769409, now seen corresponding path program 2 times [2023-12-21 15:27:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171252097] [2023-12-21 15:27:44,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:44,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:44,230 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:44,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 15:27:44,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:44,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:44,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 15:27:44,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:44,372 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 23 treesize of output 7 [2023-12-21 15:27:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2023-12-21 15:27:44,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:44,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171252097] [2023-12-21 15:27:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171252097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 15:27:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135314731] [2023-12-21 15:27:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:44,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 15:27:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 15:27:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 15:27:44,405 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:44,485 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2023-12-21 15:27:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 15:27:44,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-21 15:27:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:44,486 INFO L225 Difference]: With dead ends: 97 [2023-12-21 15:27:44,487 INFO L226 Difference]: Without dead ends: 95 [2023-12-21 15:27:44,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 15:27:44,487 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:44,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 146 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-21 15:27:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-12-21 15:27:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 87 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 15:27:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2023-12-21 15:27:44,499 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 63 [2023-12-21 15:27:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:44,500 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2023-12-21 15:27:44,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2023-12-21 15:27:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-21 15:27:44,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:44,501 INFO L195 NwaCegarLoop]: trace histogram [46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:44,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 15:27:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:44,703 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:44,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -519997628, now seen corresponding path program 1 times [2023-12-21 15:27:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74778009] [2023-12-21 15:27:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:27:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:44,705 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:27:44,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 15:27:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:44,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 15:27:44,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 15:27:45,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 2 proven. 1081 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 15:27:50,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74778009] [2023-12-21 15:27:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74778009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:50,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49] total 96 [2023-12-21 15:27:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855798176] [2023-12-21 15:27:50,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:50,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 15:27:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 15:27:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 15:27:50,354 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 96 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:28:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:28:36,205 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2023-12-21 15:28:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 15:28:36,205 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-12-21 15:28:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:28:36,207 INFO L225 Difference]: With dead ends: 186 [2023-12-21 15:28:36,207 INFO L226 Difference]: Without dead ends: 141 [2023-12-21 15:28:36,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 15:28:36,211 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 15:28:36,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 15:28:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-21 15:28:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2023-12-21 15:28:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.1044776119402986) internal successors, (148), 135 states have internal predecessors, (148), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 15:28:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2023-12-21 15:28:36,232 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 70 [2023-12-21 15:28:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:28:36,232 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2023-12-21 15:28:36,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:28:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2023-12-21 15:28:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 15:28:36,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:28:36,233 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:28:36,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 15:28:36,434 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-21 15:28:36,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:28:36,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:28:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -66682300, now seen corresponding path program 2 times [2023-12-21 15:28:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:28:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296517486] [2023-12-21 15:28:36,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:28:36,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-21 15:28:36,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:28:36,436 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-21 15:28:36,450 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-21 15:28:36,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 15:28:36,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:28:36,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-21 15:28:36,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:28:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 15:28:39,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:28:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 2 proven. 4465 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 15:28:56,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:28:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296517486] [2023-12-21 15:28:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296517486] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:28:56,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:28:56,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 97] total 192 [2023-12-21 15:28:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862197639] [2023-12-21 15:28:56,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:28:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 15:28:56,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:28:56,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 15:28:56,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 15:28:56,772 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 192 states, 192 states have (on average 1.1041666666666667) internal successors, (212), 192 states have internal predecessors, (212), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:37:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:37:01,450 INFO L93 Difference]: Finished difference Result 282 states and 407 transitions. [2023-12-21 15:37:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-21 15:37:01,451 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 1.1041666666666667) internal successors, (212), 192 states have internal predecessors, (212), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 118 [2023-12-21 15:37:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:37:01,452 INFO L225 Difference]: With dead ends: 282 [2023-12-21 15:37:01,452 INFO L226 Difference]: Without dead ends: 237 [2023-12-21 15:37:01,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 498.9s TimeCoverageRelationStatistics Valid=27454, Invalid=54056, Unknown=0, NotChecked=0, Total=81510 [2023-12-21 15:37:01,457 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 9699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 9700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-21 15:37:01,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3397 Invalid, 9700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9699 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-21 15:37:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-21 15:37:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2023-12-21 15:37:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 230 states have (on average 1.0608695652173914) internal successors, (244), 231 states have internal predecessors, (244), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 15:37:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 252 transitions. [2023-12-21 15:37:01,476 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 252 transitions. Word has length 118 [2023-12-21 15:37:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:37:01,477 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 252 transitions. [2023-12-21 15:37:01,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 1.1041666666666667) internal successors, (212), 192 states have internal predecessors, (212), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:37:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 252 transitions. [2023-12-21 15:37:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-21 15:37:01,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:37:01,481 INFO L195 NwaCegarLoop]: trace histogram [190, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:37:01,487 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-21 15:37:01,690 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-21 15:37:01,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:37:01,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:37:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash 15374404, now seen corresponding path program 3 times [2023-12-21 15:37:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:37:01,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26927899] [2023-12-21 15:37:01,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 15:37:01,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:37:01,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:37:01,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:37:01,693 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 (14)] Waiting until timeout for monitored process [2023-12-21 15:37:01,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 15:37:01,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:37:01,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 15:37:01,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:37:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18149 trivial. 0 not checked. [2023-12-21 15:37:01,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:37:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18150 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18147 trivial. 0 not checked. [2023-12-21 15:37:01,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:37:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26927899] [2023-12-21 15:37:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26927899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:37:01,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:37:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-21 15:37:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027038444] [2023-12-21 15:37:01,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:37:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 15:37:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:37:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 15:37:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 15:37:01,930 INFO L87 Difference]: Start difference. First operand 237 states and 252 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:37:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:37:02,145 INFO L93 Difference]: Finished difference Result 364 states and 437 transitions. [2023-12-21 15:37:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 15:37:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 214 [2023-12-21 15:37:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:37:02,148 INFO L225 Difference]: With dead ends: 364 [2023-12-21 15:37:02,148 INFO L226 Difference]: Without dead ends: 326 [2023-12-21 15:37:02,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-12-21 15:37:02,149 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 15:37:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 126 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 15:37:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-21 15:37:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 254. [2023-12-21 15:37:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 247 states have (on average 1.1012145748987854) internal successors, (272), 248 states have internal predecessors, (272), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 15:37:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 280 transitions. [2023-12-21 15:37:02,164 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 280 transitions. Word has length 214 [2023-12-21 15:37:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:37:02,165 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 280 transitions. [2023-12-21 15:37:02,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:37:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 280 transitions. [2023-12-21 15:37:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-21 15:37:02,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:37:02,166 INFO L195 NwaCegarLoop]: trace histogram [190, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:37:02,171 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 15:37:02,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:37:02,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:37:02,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:37:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1036442758, now seen corresponding path program 1 times [2023-12-21 15:37:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:37:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952959570] [2023-12-21 15:37:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:37:02,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 15:37:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:37:02,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 15:37:02,374 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 (15)] Waiting until timeout for monitored process [2023-12-21 15:37:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:37:02,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 192 conjunts are in the unsatisfiable core [2023-12-21 15:37:02,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:37:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18150 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 15:37:16,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:38:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18150 backedges. 2 proven. 18145 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 15:38:35,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:38:35,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952959570] [2023-12-21 15:38:35,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952959570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:38:35,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:38:35,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 193] total 384 [2023-12-21 15:38:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804815072] [2023-12-21 15:38:35,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:38:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2023-12-21 15:38:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:38:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2023-12-21 15:38:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37246, Invalid=109826, Unknown=0, NotChecked=0, Total=147072 [2023-12-21 15:38:35,403 INFO L87 Difference]: Start difference. First operand 254 states and 280 transitions. Second operand has 384 states, 384 states have (on average 1.0520833333333333) internal successors, (404), 384 states have internal predecessors, (404), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 15:39:19,527 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 574 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:39:47,750 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification. DAG size of input: 571 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:40:15,151 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 568 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:40:43,418 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 565 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:41:14,020 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 562 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:41:44,648 WARN L293 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 559 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 15:42:17,960 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 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 15:42:17,960 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 15:42:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2023-12-21 15:42:18,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 262.0s TimeCoverageRelationStatistics Valid=39550, Invalid=112160, Unknown=0, NotChecked=0, Total=151710 [2023-12-21 15:42:18,982 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 (15)] Forceful destruction successful, exit code 0 [2023-12-21 15:42:18,982 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:42:18,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 36680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 36679 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2023-12-21 15:42:18,984 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 15:42:18,985 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (254states) and FLOYD_HOARE automaton (currently 199 states, 384 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 15:42:18,988 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1] [2023-12-21 15:42:18,990 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 15:42:18,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-21 15:42:18,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:42:18 BoogieIcfgContainer [2023-12-21 15:42:18,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 15:42:18,998 INFO L158 Benchmark]: Toolchain (without parser) took 887423.56ms. Allocated memory was 381.7MB in the beginning and 498.1MB in the end (delta: 116.4MB). Free memory was 338.0MB in the beginning and 259.6MB in the end (delta: 78.4MB). Peak memory consumption was 334.9MB. Max. memory is 8.0GB. [2023-12-21 15:42:18,998 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 209.7MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 15:42:18,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.75ms. Allocated memory is still 381.7MB. Free memory was 338.0MB in the beginning and 325.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 15:42:18,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.15ms. Allocated memory is still 381.7MB. Free memory was 325.8MB in the beginning and 323.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 15:42:18,999 INFO L158 Benchmark]: Boogie Preprocessor took 47.33ms. Allocated memory is still 381.7MB. Free memory was 323.8MB in the beginning and 321.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 15:42:19,000 INFO L158 Benchmark]: RCFGBuilder took 385.29ms. Allocated memory is still 381.7MB. Free memory was 321.7MB in the beginning and 304.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 15:42:19,000 INFO L158 Benchmark]: TraceAbstraction took 886762.93ms. Allocated memory was 381.7MB in the beginning and 498.1MB in the end (delta: 116.4MB). Free memory was 304.4MB in the beginning and 259.6MB in the end (delta: 44.8MB). Peak memory consumption was 301.4MB. Max. memory is 8.0GB. [2023-12-21 15:42:19,003 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.43ms. Allocated memory is still 209.7MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.75ms. Allocated memory is still 381.7MB. Free memory was 338.0MB in the beginning and 325.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.15ms. Allocated memory is still 381.7MB. Free memory was 325.8MB in the beginning and 323.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.33ms. Allocated memory is still 381.7MB. Free memory was 323.8MB in the beginning and 321.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.29ms. Allocated memory is still 381.7MB. Free memory was 321.7MB in the beginning and 304.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 886762.93ms. Allocated memory was 381.7MB in the beginning and 498.1MB in the end (delta: 116.4MB). Free memory was 304.4MB in the beginning and 259.6MB in the end (delta: 44.8MB). Peak memory consumption was 301.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: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was constructing difference of abstraction (254states) and FLOYD_HOARE automaton (currently 199 states, 384 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.7s, OverallIterations: 14, TraceHistogramMax: 190, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 761.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 24.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 7471 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7031 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50308 IncrementalHoareTripleChecker+Invalid, 50336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 440 mSDtfsCounter, 50308 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1752 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 955 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 818.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=13, InterpolantAutomatonStates: 413, 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, 13 MinimizatonAttempts, 112 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 120.7s InterpolantComputationTime, 871 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1559 ConstructedInterpolants, 0 QuantifiedInterpolants, 3872 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2459 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 37733/85755 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