/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/nla-digbench-scaling/ps5-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:53:48,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:53:48,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 04:53:48,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:53:48,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:53:48,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:53:48,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:53:48,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:53:48,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:53:48,583 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:53:48,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:53:48,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:53:48,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:53:48,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:53:48,584 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:53:48,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:53:48,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:53:48,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:53:48,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:53:48,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:53:48,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:53:48,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:53:48,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:53:48,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:53:48,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:53:48,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:53:48,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:53:48,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:53:48,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:53:48,591 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:53:48,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 04:53:48,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:53:48,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:53:48,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:53:48,780 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:53:48,780 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:53:48,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c [2023-12-25 04:53:49,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:53:49,948 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:53:49,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c [2023-12-25 04:53:49,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e389bf332/b6178de7a9814f0fb0c4bf668f3e32f2/FLAG44d15e8ca [2023-12-25 04:53:49,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e389bf332/b6178de7a9814f0fb0c4bf668f3e32f2 [2023-12-25 04:53:49,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:53:49,974 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:53:49,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:53:49,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:53:49,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:53:49,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:53:49" (1/1) ... [2023-12-25 04:53:49,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f32142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:49, skipping insertion in model container [2023-12-25 04:53:49,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:53:49" (1/1) ... [2023-12-25 04:53:49,996 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:53:50,112 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2023-12-25 04:53:50,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:53:50,130 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:53:50,138 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2023-12-25 04:53:50,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:53:50,161 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:53:50,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50 WrapperNode [2023-12-25 04:53:50,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:53:50,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:53:50,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:53:50,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:53:50,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,185 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-12-25 04:53:50,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:53:50,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:53:50,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:53:50,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:53:50,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,210 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 04:53:50,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:53:50,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:53:50,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:53:50,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:53:50,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (1/1) ... [2023-12-25 04:53:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:53:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:53:50,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 04:53:50,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 04:53:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:53:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:53:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:53:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:53:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:53:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:53:50,341 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:53:50,344 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:53:50,594 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:53:50,619 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:53:50,619 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:53:50,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:53:50 BoogieIcfgContainer [2023-12-25 04:53:50,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:53:50,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:53:50,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:53:50,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:53:50,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:53:49" (1/3) ... [2023-12-25 04:53:50,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6654d848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:53:50, skipping insertion in model container [2023-12-25 04:53:50,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:53:50" (2/3) ... [2023-12-25 04:53:50,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6654d848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:53:50, skipping insertion in model container [2023-12-25 04:53:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:53:50" (3/3) ... [2023-12-25 04:53:50,626 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound100.c [2023-12-25 04:53:50,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:53:50,637 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:53:50,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:53:50,677 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;@6d9b5f4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:53:50,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:53:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:53:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 04:53:50,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:53:50,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:53:50,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:53:50,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:53:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 793793432, now seen corresponding path program 1 times [2023-12-25 04:53:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:53:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879031650] [2023-12-25 04:53:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:53:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:53:50,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:53:50,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 04:53:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:53:50,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:53:50,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:53:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:53:50,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:53:50,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:53:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879031650] [2023-12-25 04:53:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879031650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:53:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:53:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:53:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945904526] [2023-12-25 04:53:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:53:50,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:53:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:53:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:53:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:53:50,885 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-25 04:53:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:53:50,903 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2023-12-25 04:53:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:53:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2023-12-25 04:53:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:53:50,910 INFO L225 Difference]: With dead ends: 32 [2023-12-25 04:53:50,910 INFO L226 Difference]: Without dead ends: 15 [2023-12-25 04:53:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:53:50,914 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:53:50,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:53:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-25 04:53:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-25 04:53:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:53:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-25 04:53:50,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2023-12-25 04:53:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:53:50,940 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-25 04:53:50,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-25 04:53:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-25 04:53:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 04:53:50,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:53:50,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:53:50,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 04:53:51,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:51,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:53:51,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:53:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1922989550, now seen corresponding path program 1 times [2023-12-25 04:53:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:53:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685821978] [2023-12-25 04:53:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:53:51,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:51,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:53:51,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:53:51,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 04:53:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:53:51,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 04:53:51,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:53:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:53:51,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:53:51,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:53:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685821978] [2023-12-25 04:53:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685821978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:53:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:53:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 04:53:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896881483] [2023-12-25 04:53:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:53:51,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 04:53:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:53:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 04:53:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 04:53:51,383 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-25 04:53:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:53:51,401 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-25 04:53:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 04:53:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2023-12-25 04:53:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:53:51,402 INFO L225 Difference]: With dead ends: 25 [2023-12-25 04:53:51,402 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 04:53:51,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 04:53:51,403 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:53:51,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:53:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 04:53:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 04:53:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:53:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-25 04:53:51,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2023-12-25 04:53:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:53:51,407 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-25 04:53:51,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-25 04:53:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-25 04:53:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 04:53:51,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:53:51,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:53:51,418 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-25 04:53:51,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:51,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:53:51,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:53:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1924777010, now seen corresponding path program 1 times [2023-12-25 04:53:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:53:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991000921] [2023-12-25 04:53:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:53:51,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:53:51,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:53:51,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 04:53:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:53:51,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:53:51,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:53:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:53:51,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:53:51,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:53:51,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991000921] [2023-12-25 04:53:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991000921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:53:51,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:53:51,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 04:53:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423708146] [2023-12-25 04:53:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:53:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:53:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:53:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:53:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 04:53:51,938 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-25 04:53:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:53:53,486 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-25 04:53:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 04:53:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-12-25 04:53:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:53:53,496 INFO L225 Difference]: With dead ends: 27 [2023-12-25 04:53:53,497 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 04:53:53,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 04:53:53,498 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:53:53,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 04:53:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 04:53:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 04:53:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:53:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 04:53:53,504 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2023-12-25 04:53:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:53:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 04:53:53,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-25 04:53:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 04:53:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:53:53,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:53:53,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:53:53,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 04:53:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:53,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:53:53,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:53:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash 76913492, now seen corresponding path program 1 times [2023-12-25 04:53:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:53:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750304395] [2023-12-25 04:53:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:53:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:53:53,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:53:53,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:53:53,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 04:53:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:53:54,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:53:54,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:53:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:53:54,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:53:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:53:54,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:53:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750304395] [2023-12-25 04:53:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750304395] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:53:54,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:53:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 04:53:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672027515] [2023-12-25 04:53:54,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:53:54,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 04:53:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:53:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 04:53:54,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 04:53:54,252 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:54:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:54:00,990 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-12-25 04:54:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:54:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 04:54:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:54:01,005 INFO L225 Difference]: With dead ends: 57 [2023-12-25 04:54:01,005 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 04:54:01,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:54:01,007 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:54:01,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-25 04:54:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 04:54:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-25 04:54:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:54:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-12-25 04:54:01,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 17 [2023-12-25 04:54:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:54:01,023 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-12-25 04:54:01,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:54:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-12-25 04:54:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:54:01,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:54:01,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:54:01,041 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-25 04:54:01,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:54:01,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:54:01,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:54:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 78700952, now seen corresponding path program 1 times [2023-12-25 04:54:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:54:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565926700] [2023-12-25 04:54:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:54:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:54:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:54:01,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:54:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 04:54:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:54:01,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 04:54:01,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:54:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:54:01,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:54:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 04:54:20,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:54:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565926700] [2023-12-25 04:54:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565926700] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:54:20,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:54:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 04:54:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79622566] [2023-12-25 04:54:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:54:20,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:54:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:54:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:54:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:54:20,222 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-25 04:54:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:54:25,267 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-12-25 04:54:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:54:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2023-12-25 04:54:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:54:25,268 INFO L225 Difference]: With dead ends: 59 [2023-12-25 04:54:25,268 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 04:54:25,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:54:25,269 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:54:25,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-25 04:54:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 04:54:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-25 04:54:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:54:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-25 04:54:25,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 17 [2023-12-25 04:54:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:54:25,282 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-25 04:54:25,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-25 04:54:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-25 04:54:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 04:54:25,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:54:25,283 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:54:25,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:54:25,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:54:25,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:54:25,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:54:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash 731759343, now seen corresponding path program 1 times [2023-12-25 04:54:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:54:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831053324] [2023-12-25 04:54:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:54:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:54:25,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:54:25,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:54:25,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 04:54:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:54:25,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:54:25,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:54:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:54:26,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:54:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:54:40,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:54:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831053324] [2023-12-25 04:54:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831053324] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:54:40,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:54:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 04:54:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394755263] [2023-12-25 04:54:40,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:54:40,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:54:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:54:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:54:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:54:40,907 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:54:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:54:59,783 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-25 04:54:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 04:54:59,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-12-25 04:54:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:54:59,800 INFO L225 Difference]: With dead ends: 56 [2023-12-25 04:54:59,800 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 04:54:59,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:54:59,801 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:54:59,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-12-25 04:54:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 04:54:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-25 04:54:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:54:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-12-25 04:54:59,814 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2023-12-25 04:54:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:54:59,817 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-12-25 04:54:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:54:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-12-25 04:54:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 04:54:59,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:54:59,818 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:54:59,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 04:55:00,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:55:00,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:55:00,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:55:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1074423298, now seen corresponding path program 1 times [2023-12-25 04:55:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:55:00,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346520024] [2023-12-25 04:55:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:55:00,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:55:00,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:55:00,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:55:00,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 04:55:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:55:01,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 04:55:01,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:55:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 04:55:01,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:55:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:55:02,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:55:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346520024] [2023-12-25 04:55:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346520024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:55:02,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:55:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 04:55:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894852697] [2023-12-25 04:55:02,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:55:02,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:55:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:55:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:55:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:55:02,206 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:55:05,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:55:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:55:21,596 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2023-12-25 04:55:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 04:55:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 46 [2023-12-25 04:55:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:55:21,614 INFO L225 Difference]: With dead ends: 131 [2023-12-25 04:55:21,614 INFO L226 Difference]: Without dead ends: 121 [2023-12-25 04:55:21,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 04:55:21,616 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 96 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:55:21,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 231 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2023-12-25 04:55:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-25 04:55:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2023-12-25 04:55:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 73 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 04:55:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-12-25 04:55:21,637 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 46 [2023-12-25 04:55:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:55:21,637 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-12-25 04:55:21,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:55:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-12-25 04:55:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 04:55:21,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:55:21,638 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:55:21,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 04:55:21,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:55:21,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:55:21,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:55:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1441866883, now seen corresponding path program 2 times [2023-12-25 04:55:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:55:21,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744872464] [2023-12-25 04:55:21,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:55:21,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:55:21,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:55:21,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:55:21,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 04:55:22,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:55:22,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:55:22,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:55:22,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:55:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 04:55:24,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:56:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 04:56:02,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:56:02,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744872464] [2023-12-25 04:56:02,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744872464] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:56:02,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:56:02,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-25 04:56:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119334694] [2023-12-25 04:56:02,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:56:02,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 04:56:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:56:02,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 04:56:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-25 04:56:02,635 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:56:19,145 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:56:36,504 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:56:53,890 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:57:05,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:57:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:57:13,360 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2023-12-25 04:57:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 04:57:13,385 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 52 [2023-12-25 04:57:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:57:13,386 INFO L225 Difference]: With dead ends: 107 [2023-12-25 04:57:13,386 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 04:57:13,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-12-25 04:57:13,387 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:57:13,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 339 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2023-12-25 04:57:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 04:57:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-12-25 04:57:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:57:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2023-12-25 04:57:13,406 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 52 [2023-12-25 04:57:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:57:13,406 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2023-12-25 04:57:13,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:57:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2023-12-25 04:57:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-25 04:57:13,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:57:13,426 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:57:13,463 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-25 04:57:13,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:57:13,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:57:13,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:57:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 531722778, now seen corresponding path program 2 times [2023-12-25 04:57:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:57:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66995311] [2023-12-25 04:57:13,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:57:13,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:57:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:57:13,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:57:13,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 04:57:16,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:57:16,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:57:16,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:57:16,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:57:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 04:57:17,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:57:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 04:57:19,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:57:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66995311] [2023-12-25 04:57:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66995311] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:57:19,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:57:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-25 04:57:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060708418] [2023-12-25 04:57:19,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:57:19,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 04:57:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:57:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 04:57:19,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-12-25 04:57:19,990 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-25 04:57:39,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:57:42,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:57:47,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:58:08,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:58:15,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:58:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:58:30,564 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions. [2023-12-25 04:58:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-25 04:58:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 94 [2023-12-25 04:58:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:58:30,582 INFO L225 Difference]: With dead ends: 263 [2023-12-25 04:58:30,583 INFO L226 Difference]: Without dead ends: 253 [2023-12-25 04:58:30,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=971, Invalid=2221, Unknown=0, NotChecked=0, Total=3192 [2023-12-25 04:58:30,584 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 402 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.2s IncrementalHoareTripleChecker+Time [2023-12-25 04:58:30,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 683 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 66.2s Time] [2023-12-25 04:58:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-25 04:58:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2023-12-25 04:58:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 151 states have internal predecessors, (153), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 04:58:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2023-12-25 04:58:30,628 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 94 [2023-12-25 04:58:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:58:30,629 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2023-12-25 04:58:30,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-25 04:58:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2023-12-25 04:58:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 04:58:30,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:58:30,630 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:58:30,693 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 (10)] Ended with exit code 0 [2023-12-25 04:58:30,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:58:30,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:58:30,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:58:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 481767065, now seen corresponding path program 3 times [2023-12-25 04:58:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:58:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819945773] [2023-12-25 04:58:30,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 04:58:30,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:58:30,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:58:30,835 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:58:30,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 04:58:38,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 04:58:38,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:58:39,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 04:58:39,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:58:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 04:58:42,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:00:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 05:00:18,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:00:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819945773] [2023-12-25 05:00:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819945773] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:00:18,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:00:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-25 05:00:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123274689] [2023-12-25 05:00:18,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:00:18,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 05:00:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:00:18,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 05:00:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2023-12-25 05:00:18,355 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:00:59,830 WARN L293 SmtUtils]: Spent 16.39s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:01:23,207 WARN L293 SmtUtils]: Spent 14.55s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:01:46,586 WARN L293 SmtUtils]: Spent 17.35s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:02:01,896 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:02:17,540 WARN L293 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:02:34,493 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:03:41,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:04:01,355 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:04:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:04:02,272 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2023-12-25 05:04:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 05:04:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 100 [2023-12-25 05:04:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:04:02,306 INFO L225 Difference]: With dead ends: 209 [2023-12-25 05:04:02,306 INFO L226 Difference]: Without dead ends: 191 [2023-12-25 05:04:02,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 241.4s TimeCoverageRelationStatistics Valid=689, Invalid=2391, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 05:04:02,308 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 111 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:04:02,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 697 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 40.5s Time] [2023-12-25 05:04:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-25 05:04:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2023-12-25 05:04:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 141 states have (on average 1.0141843971631206) internal successors, (143), 141 states have internal predecessors, (143), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:04:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2023-12-25 05:04:02,353 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 100 [2023-12-25 05:04:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:04:02,353 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2023-12-25 05:04:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:04:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2023-12-25 05:04:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-25 05:04:02,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:04:02,355 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:04:02,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 05:04:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:04:02,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:04:02,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:04:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 839887442, now seen corresponding path program 3 times [2023-12-25 05:04:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:04:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958738711] [2023-12-25 05:04:02,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:04:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:04:02,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:04:02,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:04:02,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 05:04:17,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2023-12-25 05:04:17,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:04:18,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-25 05:04:18,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:04:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:04:22,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 46 proven. 968 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-25 05:04:31,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958738711] [2023-12-25 05:04:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958738711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:04:31,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:04:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2023-12-25 05:04:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571795463] [2023-12-25 05:04:31,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:04:31,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-25 05:04:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-25 05:04:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=1971, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 05:04:31,777 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand has 52 states, 52 states have (on average 4.153846153846154) internal successors, (216), 52 states have internal predecessors, (216), 45 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2023-12-25 05:05:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:05:27,959 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-25 05:05:54,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:23,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:29,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:59,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:03,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:09,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:11,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:43,711 INFO L93 Difference]: Finished difference Result 527 states and 575 transitions. [2023-12-25 05:07:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-25 05:07:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.153846153846154) internal successors, (216), 52 states have internal predecessors, (216), 45 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) Word has length 190 [2023-12-25 05:07:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:43,733 INFO L225 Difference]: With dead ends: 527 [2023-12-25 05:07:43,733 INFO L226 Difference]: Without dead ends: 517 [2023-12-25 05:07:43,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=4190, Invalid=9616, Unknown=0, NotChecked=0, Total=13806 [2023-12-25 05:07:43,736 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 1662 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 1125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1125 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:43,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2533 Invalid, 3474 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1125 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 167.2s Time] [2023-12-25 05:07:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-12-25 05:07:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 402. [2023-12-25 05:07:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 284 states have (on average 1.0880281690140845) internal successors, (309), 307 states have internal predecessors, (309), 71 states have call successors, (71), 47 states have call predecessors, (71), 46 states have return successors, (70), 47 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-25 05:07:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 450 transitions. [2023-12-25 05:07:43,848 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 450 transitions. Word has length 190 [2023-12-25 05:07:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:43,849 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 450 transitions. [2023-12-25 05:07:43,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.153846153846154) internal successors, (216), 52 states have internal predecessors, (216), 45 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2023-12-25 05:07:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 450 transitions. [2023-12-25 05:07:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-25 05:07:43,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:43,854 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:43,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 05:07:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:44,070 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:44,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1609063633, now seen corresponding path program 4 times [2023-12-25 05:07:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196715620] [2023-12-25 05:07:44,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 05:07:44,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-25 05:07:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:44,072 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:44,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 05:07:52,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 05:07:52,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:07:52,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-25 05:07:52,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:08:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2164 backedges. 48 proven. 1012 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-25 05:08:00,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 05:08:34,454 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:08:34,454 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:08:34,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:08:34,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 05:08:34,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:08:34,955 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 197 with TraceHistMax 25,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. [2023-12-25 05:08:34,959 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2023-12-25 05:08:34,960 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:08:34,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:08:34 BoogieIcfgContainer [2023-12-25 05:08:34,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:08:34,962 INFO L158 Benchmark]: Toolchain (without parser) took 884988.25ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 174.1MB in the beginning and 105.2MB in the end (delta: 68.9MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,962 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 239.1MB. Free memory is still 188.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:08:34,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.42ms. Allocated memory is still 239.1MB. Free memory was 173.9MB in the beginning and 162.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.39ms. Allocated memory is still 239.1MB. Free memory was 162.2MB in the beginning and 160.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,963 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 239.1MB. Free memory was 160.8MB in the beginning and 159.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,963 INFO L158 Benchmark]: RCFGBuilder took 401.01ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 159.0MB in the beginning and 243.3MB in the end (delta: -84.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,963 INFO L158 Benchmark]: TraceAbstraction took 884340.89ms. Allocated memory is still 287.3MB. Free memory was 242.8MB in the beginning and 105.2MB in the end (delta: 137.5MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. [2023-12-25 05:08:34,964 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.11ms. Allocated memory is still 239.1MB. Free memory is still 188.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.42ms. Allocated memory is still 239.1MB. Free memory was 173.9MB in the beginning and 162.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.39ms. Allocated memory is still 239.1MB. Free memory was 162.2MB in the beginning and 160.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 239.1MB. Free memory was 160.8MB in the beginning and 159.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.01ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 159.0MB in the beginning and 243.3MB in the end (delta: -84.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * TraceAbstraction took 884340.89ms. Allocated memory is still 287.3MB. Free memory was 242.8MB in the beginning and 105.2MB in the end (delta: 137.5MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12). Cancelled while NwaCegarLoop was analyzing trace of length 197 with TraceHistMax 25,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.3s, OverallIterations: 12, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 609.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2380 SdHoareTripleChecker+Valid, 331.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2371 mSDsluCounter, 4850 SdHoareTripleChecker+Invalid, 306.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4431 mSDsCounter, 1607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3921 IncrementalHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1607 mSolverCounterUnsat, 419 mSDtfsCounter, 3921 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1289 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4098 ImplicationChecksByTransitivity, 387.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=11, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 211 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 29.0s SatisfiabilityAnalysisTime, 192.4s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 6692 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1114 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 2339/6402 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown