/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/loop-lit/bh2017-ex1-poly.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:54:11,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:54:11,437 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-24 22:54:11,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:54:11,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:54:11,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:54:11,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:54:11,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:54:11,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:54:11,477 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:54:11,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:54:11,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:54:11,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:54:11,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:54:11,479 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:54:11,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:54:11,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:54:11,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:54:11,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:54:11,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:54:11,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:54:11,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:54:11,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:54:11,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:54:11,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:54:11,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:54:11,483 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:54:11,483 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:54:11,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:54:11,484 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:54:11,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:54:11,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:54:11,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:54:11,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:54:11,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:54:11,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:54:11,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:54:11,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:54:11,486 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:54:11,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:54:11,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:54:11,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:54:11,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:54:11,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:54:11,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:54:11,490 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:54:11,490 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-24 22:54:11,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:54:11,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:54:11,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:54:11,713 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:54:11,713 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:54:11,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i [2023-12-24 22:54:12,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:54:13,008 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:54:13,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i [2023-12-24 22:54:13,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99bafcae/24cbc837cc224175acd75351e5da5330/FLAG24eb221ed [2023-12-24 22:54:13,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99bafcae/24cbc837cc224175acd75351e5da5330 [2023-12-24 22:54:13,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:54:13,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:54:13,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:54:13,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:54:13,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:54:13,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1457db13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13, skipping insertion in model container [2023-12-24 22:54:13,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,050 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:54:13,163 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i[804,817] [2023-12-24 22:54:13,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:54:13,185 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:54:13,193 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.i[804,817] [2023-12-24 22:54:13,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:54:13,210 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:54:13,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13 WrapperNode [2023-12-24 22:54:13,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:54:13,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:54:13,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:54:13,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:54:13,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,239 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2023-12-24 22:54:13,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:54:13,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:54:13,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:54:13,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:54:13,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,258 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 22:54:13,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:54:13,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:54:13,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:54:13,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:54:13,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (1/1) ... [2023-12-24 22:54:13,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:54:13,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:54:13,295 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-24 22:54:13,301 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-24 22:54:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:54:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:54:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:54:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:54:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-24 22:54:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-24 22:54:13,373 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:54:13,375 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:54:13,491 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:54:13,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:54:13,511 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 22:54:13,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:54:13 BoogieIcfgContainer [2023-12-24 22:54:13,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:54:13,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:54:13,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:54:13,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:54:13,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:54:13" (1/3) ... [2023-12-24 22:54:13,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:54:13, skipping insertion in model container [2023-12-24 22:54:13,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:13" (2/3) ... [2023-12-24 22:54:13,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:54:13, skipping insertion in model container [2023-12-24 22:54:13,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:54:13" (3/3) ... [2023-12-24 22:54:13,519 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2023-12-24 22:54:13,534 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:54:13,535 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:54:13,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:54:13,573 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;@4c123293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:54:13,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:54:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 22:54:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:54:13,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:13,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:13,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:13,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2023-12-24 22:54:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194101021] [2023-12-24 22:54:13,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:54:13,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:13,608 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-24 22:54:13,612 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-24 22:54:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:13,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:54:13,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:13,736 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-24 22:54:13,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:13,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194101021] [2023-12-24 22:54:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194101021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:54:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406951968] [2023-12-24 22:54:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:54:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:13,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:54:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:54:13,783 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-24 22:54:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:13,860 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2023-12-24 22:54:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:54:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-12-24 22:54:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:13,871 INFO L225 Difference]: With dead ends: 40 [2023-12-24 22:54:13,871 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 22:54:13,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-24 22:54:13,880 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:13,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 22:54:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-24 22:54:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 22:54:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2023-12-24 22:54:13,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2023-12-24 22:54:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:13,924 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-12-24 22:54:13,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-24 22:54:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2023-12-24 22:54:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:54:13,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:13,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:13,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 22:54:14,136 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-24 22:54:14,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:14,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2023-12-24 22:54:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934777185] [2023-12-24 22:54:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:14,138 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-24 22:54:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:14,139 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-24 22:54:14,140 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-24 22:54:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:14,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:54:14,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:14,256 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-24 22:54:14,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:14,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:14,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934777185] [2023-12-24 22:54:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934777185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 22:54:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607529165] [2023-12-24 22:54:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:54:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:54:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:54:14,259 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-24 22:54:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:14,366 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-12-24 22:54:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:54:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2023-12-24 22:54:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:14,370 INFO L225 Difference]: With dead ends: 46 [2023-12-24 22:54:14,370 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 22:54:14,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:54:14,372 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 22:54:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-24 22:54:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 22:54:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-12-24 22:54:14,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 7 [2023-12-24 22:54:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:14,409 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-12-24 22:54:14,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-24 22:54:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-12-24 22:54:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:54:14,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:14,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:14,420 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-24 22:54:14,610 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-24 22:54:14,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:14,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2023-12-24 22:54:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055262619] [2023-12-24 22:54:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:14,612 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-24 22:54:14,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:14,614 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-24 22:54:14,619 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-24 22:54:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:14,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:54:14,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:54:14,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:14,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055262619] [2023-12-24 22:54:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055262619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 22:54:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705143550] [2023-12-24 22:54:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:14,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 22:54:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 22:54:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:54:14,715 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 22:54:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:14,842 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-24 22:54:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 22:54:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-24 22:54:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:14,844 INFO L225 Difference]: With dead ends: 45 [2023-12-24 22:54:14,845 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 22:54:14,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:54:14,848 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:14,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 22:54:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-12-24 22:54:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 22:54:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-12-24 22:54:14,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 12 [2023-12-24 22:54:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:14,868 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-12-24 22:54:14,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 22:54:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-12-24 22:54:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 22:54:14,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:14,869 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:14,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 22:54:15,069 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-24 22:54:15,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:15,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1617941577, now seen corresponding path program 1 times [2023-12-24 22:54:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243595757] [2023-12-24 22:54:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:15,071 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-24 22:54:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:15,073 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-24 22:54:15,078 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-24 22:54:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:15,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:54:15,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 22:54:15,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 22:54:15,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243595757] [2023-12-24 22:54:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243595757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:15,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-24 22:54:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702556397] [2023-12-24 22:54:15,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:15,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:54:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:54:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:54:15,310 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 22:54:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:15,497 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2023-12-24 22:54:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:54:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 28 [2023-12-24 22:54:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:15,504 INFO L225 Difference]: With dead ends: 73 [2023-12-24 22:54:15,504 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 22:54:15,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:54:15,505 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:15,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 119 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 22:54:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-24 22:54:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 22:54:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-12-24 22:54:15,515 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 28 [2023-12-24 22:54:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:15,515 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-12-24 22:54:15,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 22:54:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-12-24 22:54:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 22:54:15,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:15,517 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:15,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 22:54:15,719 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-24 22:54:15,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:15,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1192651634, now seen corresponding path program 2 times [2023-12-24 22:54:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396719363] [2023-12-24 22:54:15,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:54:15,721 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-24 22:54:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:15,722 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-24 22:54:15,746 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-24 22:54:15,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:54:15,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:15,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 22:54:15,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 22:54:15,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 22:54:16,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396719363] [2023-12-24 22:54:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396719363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:16,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-24 22:54:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108760288] [2023-12-24 22:54:16,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:16,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:54:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:54:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:54:16,125 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-24 22:54:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:16,732 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2023-12-24 22:54:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 22:54:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 33 [2023-12-24 22:54:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:16,734 INFO L225 Difference]: With dead ends: 84 [2023-12-24 22:54:16,735 INFO L226 Difference]: Without dead ends: 82 [2023-12-24 22:54:16,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-24 22:54:16,736 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:16,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 22:54:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-24 22:54:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-12-24 22:54:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 22:54:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2023-12-24 22:54:16,755 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 33 [2023-12-24 22:54:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:16,755 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2023-12-24 22:54:16,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-24 22:54:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2023-12-24 22:54:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-24 22:54:16,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:16,757 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:16,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 22:54:16,960 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-24 22:54:16,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:16,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 359688270, now seen corresponding path program 1 times [2023-12-24 22:54:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281818436] [2023-12-24 22:54:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:16,962 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-24 22:54:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:16,963 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-24 22:54:16,963 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-24 22:54:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:17,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 22:54:17,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 22:54:17,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 22:54:21,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281818436] [2023-12-24 22:54:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281818436] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:21,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-24 22:54:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214757556] [2023-12-24 22:54:21,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 22:54:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 22:54:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:54:21,601 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-12-24 22:54:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:29,182 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2023-12-24 22:54:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 22:54:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 82 [2023-12-24 22:54:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:29,184 INFO L225 Difference]: With dead ends: 113 [2023-12-24 22:54:29,184 INFO L226 Difference]: Without dead ends: 111 [2023-12-24 22:54:29,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-12-24 22:54:29,186 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:29,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 194 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-24 22:54:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-24 22:54:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-12-24 22:54:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 22:54:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2023-12-24 22:54:29,218 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 82 [2023-12-24 22:54:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:29,219 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2023-12-24 22:54:29,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-12-24 22:54:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2023-12-24 22:54:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 22:54:29,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:29,221 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-12-24 22:54:29,227 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-24 22:54:29,424 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-24 22:54:29,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:29,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -306338874, now seen corresponding path program 2 times [2023-12-24 22:54:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:29,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688415776] [2023-12-24 22:54:29,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:54:29,426 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-24 22:54:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:29,427 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-24 22:54:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:54:29,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:54:29,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:29,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 22:54:29,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 50 proven. 61 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 22:54:29,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 50 proven. 61 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 22:54:37,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688415776] [2023-12-24 22:54:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688415776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:37,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:37,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-24 22:54:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299695389] [2023-12-24 22:54:37,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:37,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 22:54:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:37,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 22:54:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2023-12-24 22:54:37,609 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2023-12-24 22:55:00,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:55:15,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:55:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:55:43,857 INFO L93 Difference]: Finished difference Result 153 states and 203 transitions. [2023-12-24 22:55:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 22:55:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 142 [2023-12-24 22:55:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:55:43,860 INFO L225 Difference]: With dead ends: 153 [2023-12-24 22:55:43,860 INFO L226 Difference]: Without dead ends: 151 [2023-12-24 22:55:43,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=283, Invalid=975, Unknown=2, NotChecked=0, Total=1260 [2023-12-24 22:55:43,862 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:55:43,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 486 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2023-12-24 22:55:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-24 22:55:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2023-12-24 22:55:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-24 22:55:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2023-12-24 22:55:43,897 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 142 [2023-12-24 22:55:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:55:43,898 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 196 transitions. [2023-12-24 22:55:43,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (52), 3 states have call predecessors, (52), 1 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2023-12-24 22:55:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2023-12-24 22:55:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-24 22:55:43,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:55:43,903 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2023-12-24 22:55:43,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:55:44,111 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-24 22:55:44,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:55:44,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:55:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash -854452498, now seen corresponding path program 3 times [2023-12-24 22:55:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:55:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007334232] [2023-12-24 22:55:44,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:55:44,113 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-24 22:55:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:55:44,114 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-24 22:55:44,130 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-24 22:55:44,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-12-24 22:55:44,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:55:44,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-24 22:55:44,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:55:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 380 proven. 335 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2023-12-24 22:55:44,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:56:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 304 proven. 231 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2023-12-24 22:56:03,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:56:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007334232] [2023-12-24 22:56:03,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007334232] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:56:03,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:56:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 43 [2023-12-24 22:56:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968593180] [2023-12-24 22:56:03,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:56:03,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-24 22:56:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:56:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-24 22:56:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2023-12-24 22:56:03,071 INFO L87 Difference]: Start difference. First operand 148 states and 196 transitions. Second operand has 43 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 17 states have call successors, (78), 3 states have call predecessors, (78), 2 states have return successors, (76), 19 states have call predecessors, (76), 17 states have call successors, (76) [2023-12-24 22:56:10,918 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 110 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:56:13,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:26,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:30,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:34,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:38,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:42,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:56:56,338 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 61 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:57:00,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:57:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:57:25,800 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:57:29,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:57:33,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 22:57:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:57:51,259 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2023-12-24 22:57:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-24 22:57:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 17 states have call successors, (78), 3 states have call predecessors, (78), 2 states have return successors, (76), 19 states have call predecessors, (76), 17 states have call successors, (76) Word has length 212 [2023-12-24 22:57:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:57:51,268 INFO L225 Difference]: With dead ends: 202 [2023-12-24 22:57:51,268 INFO L226 Difference]: Without dead ends: 200 [2023-12-24 22:57:51,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 70.6s TimeCoverageRelationStatistics Valid=979, Invalid=3311, Unknown=0, NotChecked=0, Total=4290 [2023-12-24 22:57:51,270 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 358 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.6s IncrementalHoareTripleChecker+Time [2023-12-24 22:57:51,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 842 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1269 Invalid, 9 Unknown, 0 Unchecked, 51.6s Time] [2023-12-24 22:57:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-24 22:57:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2023-12-24 22:57:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 93 states have (on average 1.010752688172043) internal successors, (94), 94 states have internal predecessors, (94), 87 states have call successors, (87), 18 states have call predecessors, (87), 18 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-24 22:57:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 268 transitions. [2023-12-24 22:57:51,317 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 268 transitions. Word has length 212 [2023-12-24 22:57:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:57:51,318 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 268 transitions. [2023-12-24 22:57:51,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 17 states have call successors, (78), 3 states have call predecessors, (78), 2 states have return successors, (76), 19 states have call predecessors, (76), 17 states have call successors, (76) [2023-12-24 22:57:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 268 transitions. [2023-12-24 22:57:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-24 22:57:51,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:57:51,322 INFO L195 NwaCegarLoop]: trace histogram [54, 53, 53, 10, 10, 10, 10, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2023-12-24 22:57:51,329 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-24 22:57:51,527 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-24 22:57:51,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:57:51,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:57:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -848622030, now seen corresponding path program 4 times [2023-12-24 22:57:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:57:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435523527] [2023-12-24 22:57:51,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:57:51,529 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-24 22:57:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:57:51,529 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-24 22:57:51,531 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-24 22:57:51,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:57:51,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:57:51,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 22:57:51,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:57:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5911 backedges. 1128 proven. 218 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2023-12-24 22:57:52,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:58:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5911 backedges. 178 proven. 218 refuted. 0 times theorem prover too weak. 5515 trivial. 0 not checked. [2023-12-24 22:58:02,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:58:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435523527] [2023-12-24 22:58:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435523527] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:58:02,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:58:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2023-12-24 22:58:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846592231] [2023-12-24 22:58:02,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:58:02,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-24 22:58:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:58:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-24 22:58:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 22:58:02,596 INFO L87 Difference]: Start difference. First operand 199 states and 268 transitions. Second operand has 36 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 17 states have call predecessors, (104), 17 states have call successors, (104) [2023-12-24 22:58:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:58:03,664 INFO L93 Difference]: Finished difference Result 211 states and 277 transitions. [2023-12-24 22:58:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 22:58:03,671 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 17 states have call predecessors, (104), 17 states have call successors, (104) Word has length 293 [2023-12-24 22:58:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:58:03,672 INFO L225 Difference]: With dead ends: 211 [2023-12-24 22:58:03,672 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 22:58:03,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 22:58:03,675 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:58:03,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1119 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 22:58:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 22:58:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 22:58:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:58:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 22:58:03,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2023-12-24 22:58:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:58:03,676 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 22:58:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 17 states have call predecessors, (104), 17 states have call successors, (104) [2023-12-24 22:58:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 22:58:03,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 22:58:03,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:58:03,686 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-24 22:58:03,880 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-24 22:58:03,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 22:58:04,237 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 22:58:04,237 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-24 22:58:04,238 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))))) [2023-12-24 22:58:04,238 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse3 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse2) (and .cse4 .cse2) (and .cse0 .cse4))) [2023-12-24 22:58:04,238 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse3 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse2) (and .cse4 .cse2) (and .cse0 .cse4))) [2023-12-24 22:58:04,238 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse3 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse2) (and .cse4 .cse2) (and .cse0 .cse4))) [2023-12-24 22:58:04,238 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))))) [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))))) [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L24(lines 18 25) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse4 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (.cse6 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse0 (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32))) (.cse1 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse0) (and .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse0) (and .cse2 .cse0) (and .cse2 .cse3) (and .cse1 .cse4) (and .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and .cse6 .cse3) (and .cse5 .cse3) (and .cse6 .cse0) (and .cse1 .cse5))) [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse3 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse2) (and .cse4 .cse2) (and .cse0 .cse4))) [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 25) the Hoare annotation is: (let ((.cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))))) [2023-12-24 22:58:04,239 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 31) the Hoare annotation is: (or (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point L16-3(lines 16 31) no Hoare annotation was computed. [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-24 22:58:04,240 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-24 22:58:04,240 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-24 22:58:04,243 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2023-12-24 22:58:04,245 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:58:04,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:58:04 BoogieIcfgContainer [2023-12-24 22:58:04,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:58:04,262 INFO L158 Benchmark]: Toolchain (without parser) took 231234.81ms. Allocated memory was 315.6MB in the beginning and 419.4MB in the end (delta: 103.8MB). Free memory was 272.4MB in the beginning and 295.2MB in the end (delta: -22.8MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,262 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 207.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:58:04,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 315.6MB. Free memory was 272.4MB in the beginning and 261.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.74ms. Allocated memory is still 315.6MB. Free memory was 261.2MB in the beginning and 259.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,263 INFO L158 Benchmark]: Boogie Preprocessor took 28.20ms. Allocated memory is still 315.6MB. Free memory was 259.8MB in the beginning and 258.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,263 INFO L158 Benchmark]: RCFGBuilder took 242.87ms. Allocated memory is still 315.6MB. Free memory was 257.7MB in the beginning and 246.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,264 INFO L158 Benchmark]: TraceAbstraction took 230747.78ms. Allocated memory was 315.6MB in the beginning and 419.4MB in the end (delta: 103.8MB). Free memory was 245.9MB in the beginning and 295.2MB in the end (delta: -49.2MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2023-12-24 22:58:04,265 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.17ms. Allocated memory is still 207.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 315.6MB. Free memory was 272.4MB in the beginning and 261.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.74ms. Allocated memory is still 315.6MB. Free memory was 261.2MB in the beginning and 259.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.20ms. Allocated memory is still 315.6MB. Free memory was 259.8MB in the beginning and 258.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 242.87ms. Allocated memory is still 315.6MB. Free memory was 257.7MB in the beginning and 246.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 230747.78ms. Allocated memory was 315.6MB in the beginning and 419.4MB in the end (delta: 103.8MB). Free memory was 245.9MB in the beginning and 295.2MB in the end (delta: -49.2MB). Peak memory consumption was 55.6MB. 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 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 230.7s, OverallIterations: 9, TraceHistogramMax: 54, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 184.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 78.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 3106 SdHoareTripleChecker+Invalid, 77.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2816 mSDsCounter, 677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3352 IncrementalHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 677 mSolverCounterUnsat, 290 mSDtfsCounter, 3352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1632 GetRequests, 1440 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 138.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=8, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 125 PreInvPairs, 190 NumberOfFragments, 446 HoareAnnotationTreeSize, 125 FormulaSimplifications, 2790 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 43.2s InterpolantComputationTime, 816 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1591 ConstructedInterpolants, 0 QuantifiedInterpolants, 6153 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1249 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 20334/21502 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (((((i == 1) || (i == 0)) || (i == 2)) || (i == 3)) || (4 == i)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((((((i == 0) && (j == 0)) || ((4 == j) && (i == 2))) || ((j == 2) && (4 == i))) || ((i == 3) && (j == 0))) || ((i == 2) && (j == 0))) || ((i == 2) && (j == 2))) || ((4 == j) && (4 == i))) || ((4 == j) && (i == 5))) || ((i == 1) && (j == 2))) || ((i == 3) && (j == 2))) || ((i == 1) && (j == 0))) || ((4 == j) && (i == 3))) RESULT: Ultimate proved your program to be correct! [2023-12-24 22:58:04,290 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 Received shutdown request...