/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/egcd3-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:01:04,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:01:04,843 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 02:01:04,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:01:04,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:01:04,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:01:04,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:01:04,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:01:04,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:01:04,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:01:04,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:01:04,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:01:04,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:01:04,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:01:04,874 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:01:04,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:01:04,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:01:04,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:01:04,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:01:04,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:01:04,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:01:04,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:01:04,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:01:04,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:01:04,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:01:04,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:01:04,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:01:04,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:01:04,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:01:04,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:01:04,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:01:04,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:01:04,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:01:04,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:01:04,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:01:04,880 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 02:01:05,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:01:05,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:01:05,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:01:05,102 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:01:05,103 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:01:05,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound20.c [2023-12-25 02:01:06,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:01:06,368 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:01:06,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound20.c [2023-12-25 02:01:06,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6386466/e8af1ec2354941e1bd278086e5e54b70/FLAG9fdbef1aa [2023-12-25 02:01:06,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6386466/e8af1ec2354941e1bd278086e5e54b70 [2023-12-25 02:01:06,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:01:06,393 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:01:06,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:01:06,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:01:06,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:01:06,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f36562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06, skipping insertion in model container [2023-12-25 02:01:06,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:01:06,538 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/egcd3-ll_valuebound20.c[490,503] [2023-12-25 02:01:06,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:01:06,582 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:01:06,594 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/egcd3-ll_valuebound20.c[490,503] [2023-12-25 02:01:06,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:01:06,623 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:01:06,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06 WrapperNode [2023-12-25 02:01:06,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:01:06,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:01:06,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:01:06,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:01:06,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,657 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-25 02:01:06,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:01:06,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:01:06,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:01:06,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:01:06,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,678 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 02:01:06,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:01:06,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:01:06,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:01:06,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:01:06,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (1/1) ... [2023-12-25 02:01:06,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:01:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:01:06,718 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 02:01:06,740 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 02:01:06,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:01:06,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:01:06,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:01:06,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:01:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:01:06,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:01:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:01:06,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:01:06,801 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:01:06,803 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:01:07,155 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:01:07,177 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:01:07,177 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 02:01:07,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:01:07 BoogieIcfgContainer [2023-12-25 02:01:07,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:01:07,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:01:07,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:01:07,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:01:07,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:01:06" (1/3) ... [2023-12-25 02:01:07,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a321e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:01:07, skipping insertion in model container [2023-12-25 02:01:07,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:01:06" (2/3) ... [2023-12-25 02:01:07,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a321e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:01:07, skipping insertion in model container [2023-12-25 02:01:07,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:01:07" (3/3) ... [2023-12-25 02:01:07,185 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound20.c [2023-12-25 02:01:07,199 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:01:07,201 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:01:07,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:01:07,241 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;@bac559e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:01:07,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:01:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 02:01:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:01:07,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:07,251 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:07,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:07,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash 67099435, now seen corresponding path program 1 times [2023-12-25 02:01:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488053584] [2023-12-25 02:01:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:07,266 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 02:01:07,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:07,268 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 02:01:07,293 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 02:01:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:07,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:01:07,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:01:07,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:01:07,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:07,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488053584] [2023-12-25 02:01:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488053584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:01:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:01:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:01:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072865175] [2023-12-25 02:01:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:01:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:01:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:01:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:01:07,512 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:07,551 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2023-12-25 02:01:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:01:07,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 02:01:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:07,558 INFO L225 Difference]: With dead ends: 62 [2023-12-25 02:01:07,558 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 02:01:07,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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 02:01:07,562 INFO L413 NwaCegarLoop]: 39 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, 39 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 02:01:07,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:01:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 02:01:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 02:01:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:01:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-25 02:01:07,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 28 [2023-12-25 02:01:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:07,594 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-25 02:01:07,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-25 02:01:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 02:01:07,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:07,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:07,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 02:01:07,803 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 02:01:07,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:07,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1772608446, now seen corresponding path program 1 times [2023-12-25 02:01:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432475951] [2023-12-25 02:01:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:07,811 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 02:01:07,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:07,812 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 02:01:07,813 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 02:01:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:07,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 02:01:07,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:08,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:01:08,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432475951] [2023-12-25 02:01:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432475951] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:01:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:01:08,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-12-25 02:01:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793861035] [2023-12-25 02:01:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:01:08,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 02:01:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 02:01:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 02:01:08,453 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:08,950 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 02:01:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:01:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-25 02:01:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:08,956 INFO L225 Difference]: With dead ends: 39 [2023-12-25 02:01:08,956 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 02:01:08,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:01:08,958 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:08,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 02:01:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 02:01:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 02:01:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:01:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 02:01:08,963 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 29 [2023-12-25 02:01:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:08,966 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 02:01:08,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 02:01:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 02:01:08,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:08,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:08,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 02:01:09,178 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 02:01:09,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:09,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1072684582, now seen corresponding path program 1 times [2023-12-25 02:01:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353703533] [2023-12-25 02:01:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:09,180 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 02:01:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:09,181 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 02:01:09,186 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 02:01:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:09,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:01:09,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:09,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:01:14,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353703533] [2023-12-25 02:01:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353703533] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:01:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:01:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:01:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477851737] [2023-12-25 02:01:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:01:14,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:01:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:01:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:01:14,377 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:18,736 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-25 02:01:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:01:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-25 02:01:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:18,765 INFO L225 Difference]: With dead ends: 48 [2023-12-25 02:01:18,765 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 02:01:18,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:01:18,766 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:18,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 02:01:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 02:01:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 02:01:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:01:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-25 02:01:18,776 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2023-12-25 02:01:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:18,777 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-25 02:01:18,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:01:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-25 02:01:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:01:18,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:18,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:18,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 02:01:18,979 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 02:01:18,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:18,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 581538888, now seen corresponding path program 1 times [2023-12-25 02:01:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125220777] [2023-12-25 02:01:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:18,981 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 02:01:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:18,983 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 02:01:18,986 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 02:01:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:19,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 02:01:19,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:19,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:01:20,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125220777] [2023-12-25 02:01:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125220777] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:01:20,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:01:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-25 02:01:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236308302] [2023-12-25 02:01:20,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:01:20,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:01:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:01:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:01:20,363 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:01:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:25,082 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2023-12-25 02:01:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 02:01:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2023-12-25 02:01:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:25,092 INFO L225 Difference]: With dead ends: 113 [2023-12-25 02:01:25,092 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 02:01:25,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-25 02:01:25,093 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:25,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 269 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-25 02:01:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 02:01:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2023-12-25 02:01:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:01:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2023-12-25 02:01:25,123 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 34 [2023-12-25 02:01:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:25,123 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2023-12-25 02:01:25,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:01:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2023-12-25 02:01:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:01:25,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:25,124 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:25,139 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 02:01:25,336 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 02:01:25,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:25,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1534715754, now seen corresponding path program 1 times [2023-12-25 02:01:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307521030] [2023-12-25 02:01:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:25,337 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 02:01:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:25,338 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 02:01:25,344 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 02:01:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:25,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:01:25,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:26,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:01:33,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307521030] [2023-12-25 02:01:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307521030] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:01:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:01:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:01:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130845409] [2023-12-25 02:01:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:01:33,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:01:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:01:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:01:33,050 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:01:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:01:40,043 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2023-12-25 02:01:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:01:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-25 02:01:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:01:40,076 INFO L225 Difference]: With dead ends: 60 [2023-12-25 02:01:40,076 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 02:01:40,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:01:40,077 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:01:40,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-25 02:01:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 02:01:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-25 02:01:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:01:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-12-25 02:01:40,089 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 37 [2023-12-25 02:01:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:01:40,089 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-12-25 02:01:40,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:01:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-12-25 02:01:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:01:40,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:01:40,090 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:40,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 02:01:40,297 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 02:01:40,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:01:40,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:01:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1190433772, now seen corresponding path program 1 times [2023-12-25 02:01:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:01:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91063991] [2023-12-25 02:01:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:01:40,298 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 02:01:40,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:01:40,299 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 02:01:40,300 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 02:01:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:01:40,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 02:01:40,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:01:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:01:41,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:01:54,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91063991] [2023-12-25 02:01:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91063991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:01:54,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:01:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 02:01:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477460007] [2023-12-25 02:01:54,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:01:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:01:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:01:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:01:54,575 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:02:05,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:14,571 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2023-12-25 02:02:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 02:02:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2023-12-25 02:02:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:14,603 INFO L225 Difference]: With dead ends: 82 [2023-12-25 02:02:14,603 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 02:02:14,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 02:02:14,604 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:14,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 323 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 15.3s Time] [2023-12-25 02:02:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 02:02:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-12-25 02:02:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 02:02:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2023-12-25 02:02:14,623 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 37 [2023-12-25 02:02:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:14,624 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2023-12-25 02:02:14,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:02:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2023-12-25 02:02:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:02:14,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:14,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:14,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 02:02:14,836 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 02:02:14,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:14,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1246105370, now seen corresponding path program 1 times [2023-12-25 02:02:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805118909] [2023-12-25 02:02:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:02:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:14,839 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 02:02:14,849 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 02:02:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:15,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 02:02:15,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 02:02:16,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 02:02:20,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:20,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805118909] [2023-12-25 02:02:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805118909] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:02:20,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:02:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 02:02:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650984076] [2023-12-25 02:02:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:02:20,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:02:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:02:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:02:20,833 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:02:26,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:02:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:26,948 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2023-12-25 02:02:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:02:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-12-25 02:02:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:26,962 INFO L225 Difference]: With dead ends: 104 [2023-12-25 02:02:26,962 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 02:02:26,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:02:26,963 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 02:02:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 02:02:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-12-25 02:02:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-25 02:02:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2023-12-25 02:02:27,028 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 42 [2023-12-25 02:02:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:27,028 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2023-12-25 02:02:27,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:02:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2023-12-25 02:02:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:02:27,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:27,031 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:27,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 02:02:27,231 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 02:02:27,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:27,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1174265188, now seen corresponding path program 1 times [2023-12-25 02:02:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:27,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178648796] [2023-12-25 02:02:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:27,233 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 02:02:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:27,235 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 02:02:27,235 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 02:02:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:27,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:02:27,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:29,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:42,472 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:03:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:03:26,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:03:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178648796] [2023-12-25 02:03:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178648796] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:03:26,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:03:26,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-25 02:03:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156891018] [2023-12-25 02:03:26,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:03:26,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 02:03:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:03:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 02:03:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 02:03:26,195 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:03:28,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:30,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:33,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:52,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:36,085 WARN L293 SmtUtils]: Spent 14.55s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:04:42,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:46,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:19,295 WARN L293 SmtUtils]: Spent 12.94s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:05:20,869 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 02:05:24,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:25,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:34,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:36,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:40,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:44,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:47,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:55,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:59,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:02,478 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 02:06:04,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:08,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:13,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:16,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:06:18,054 INFO L93 Difference]: Finished difference Result 203 states and 285 transitions. [2023-12-25 02:06:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 02:06:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-12-25 02:06:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:06:18,099 INFO L225 Difference]: With dead ends: 203 [2023-12-25 02:06:18,099 INFO L226 Difference]: Without dead ends: 201 [2023-12-25 02:06:18,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 127.8s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-12-25 02:06:18,101 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 247 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 130 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:06:18,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 266 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 326 Invalid, 6 Unknown, 0 Unchecked, 84.8s Time] [2023-12-25 02:06:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-25 02:06:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2023-12-25 02:06:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 121 states have internal predecessors, (152), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-25 02:06:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2023-12-25 02:06:18,149 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 42 [2023-12-25 02:06:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:06:18,150 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2023-12-25 02:06:18,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:06:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2023-12-25 02:06:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 02:06:18,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:06:18,151 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:06:18,167 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 02:06:18,367 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 02:06:18,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:06:18,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:06:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash 225223382, now seen corresponding path program 1 times [2023-12-25 02:06:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:06:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872411416] [2023-12-25 02:06:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:06:18,369 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 02:06:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:06:18,370 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 02:06:18,372 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 02:06:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:06:18,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 02:06:18,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:06:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 02:06:19,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:06:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 02:06:24,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:06:24,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872411416] [2023-12-25 02:06:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872411416] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:06:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:06:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:06:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643337123] [2023-12-25 02:06:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:06:24,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:06:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:06:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:06:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:06:24,730 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:06:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:06:34,449 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2023-12-25 02:06:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:06:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-12-25 02:06:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:06:34,472 INFO L225 Difference]: With dead ends: 288 [2023-12-25 02:06:34,472 INFO L226 Difference]: Without dead ends: 286 [2023-12-25 02:06:34,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:06:34,473 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:06:34,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2023-12-25 02:06:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-25 02:06:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2023-12-25 02:06:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 152 states have internal predecessors, (169), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (116), 102 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-25 02:06:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2023-12-25 02:06:34,564 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 47 [2023-12-25 02:06:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:06:34,564 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2023-12-25 02:06:34,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:06:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2023-12-25 02:06:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 02:06:34,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:06:34,569 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:06:34,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 02:06:34,778 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 02:06:34,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:06:34,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:06:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash 371933676, now seen corresponding path program 1 times [2023-12-25 02:06:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:06:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082341626] [2023-12-25 02:06:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:06:34,779 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 02:06:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:06:34,780 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 02:06:34,782 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 02:06:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:06:35,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 02:06:35,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:06:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 02:06:42,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:07:30,977 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:08:41,550 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:09:01,613 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:08,085 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:09:21,076 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:28,264 WARN L876 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:09:36,545 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:43,021 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:51,072 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:59,057 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:06,071 WARN L876 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= |c_ULTIMATE.start_main_~v~0#1| (bvmul |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:10:18,664 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:27,259 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:35,759 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:39,953 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23| (_ BitVec 64)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| (_ BitVec 32))) (or (= (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) (.cse2 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43|))) (bvadd (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse0) (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse1) (bvneg (bvmul .cse1 (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse2)) |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8|))) (bvneg (bvmul (bvadd |v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (bvneg (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse2))) .cse0)))) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) (bvsge (bvmul (_ bv18446744073709551615 64) (bvneg |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (= (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 02:10:51,853 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:13,955 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:21,253 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:26,266 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:19,258 WARN L293 SmtUtils]: Spent 37.61s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:13:25,591 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:34,184 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:42,573 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:49,703 WARN L293 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:58,320 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:06,906 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:15,284 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:21,255 WARN L293 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:26,463 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:33,392 WARN L293 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:41,780 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:49,455 WARN L293 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:58,071 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:06,223 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:14,606 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:23,239 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:32,160 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-25 02:15:52,838 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:15:52,841 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 02:15:53,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 02:15:54,041 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 02:15:54,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 02:15:54,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:15:54,109 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 02:15:54,112 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:15:54,113 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:15:54,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:15:54 BoogieIcfgContainer [2023-12-25 02:15:54,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:15:54,115 INFO L158 Benchmark]: Toolchain (without parser) took 887721.45ms. Allocated memory is still 270.5MB. Free memory was 227.3MB in the beginning and 237.3MB in the end (delta: -10.0MB). Peak memory consumption was 146.1MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,115 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 225.4MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:15:54,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.41ms. Allocated memory is still 270.5MB. Free memory was 227.3MB in the beginning and 215.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.99ms. Allocated memory is still 270.5MB. Free memory was 215.3MB in the beginning and 213.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,115 INFO L158 Benchmark]: Boogie Preprocessor took 31.04ms. Allocated memory is still 270.5MB. Free memory was 213.5MB in the beginning and 211.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,116 INFO L158 Benchmark]: RCFGBuilder took 488.28ms. Allocated memory is still 270.5MB. Free memory was 211.4MB in the beginning and 197.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,116 INFO L158 Benchmark]: TraceAbstraction took 886934.73ms. Allocated memory is still 270.5MB. Free memory was 197.5MB in the beginning and 237.3MB in the end (delta: -39.8MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. [2023-12-25 02:15:54,116 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.16ms. Allocated memory is still 225.4MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.41ms. Allocated memory is still 270.5MB. Free memory was 227.3MB in the beginning and 215.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.99ms. Allocated memory is still 270.5MB. Free memory was 215.3MB in the beginning and 213.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.04ms. Allocated memory is still 270.5MB. Free memory was 213.5MB in the beginning and 211.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.28ms. Allocated memory is still 270.5MB. Free memory was 211.4MB in the beginning and 197.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 886934.73ms. Allocated memory is still 270.5MB. Free memory was 197.5MB in the beginning and 237.3MB in the end (delta: -39.8MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.9s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 224.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 130.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 1465 SdHoareTripleChecker+Invalid, 120.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1156 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 309 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 156.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=9, InterpolantAutomatonStates: 77, 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, 9 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 99.4s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 611 ConstructedInterpolants, 26 QuantifiedInterpolants, 2912 SizeOfPredicates, 30 NumberOfNonLiveVariables, 621 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 387/488 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