/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:59:47,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:59:47,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 04:59:47,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:59:47,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:59:47,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:59:47,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:59:47,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:59:47,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:59:47,884 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:59:47,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:59:47,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:59:47,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:59:47,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:59:47,887 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:59:47,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:59:47,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:59:47,888 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:59:47,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:59:47,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:59:47,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:59:47,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:59:47,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:59:47,889 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:59:47,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:59:47,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:59:47,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:59:47,890 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:59:47,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:59:47,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:59:47,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:59:47,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:59:47,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:59:47,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:59:47,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:59:47,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:59:47,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:59:47,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:59:47,893 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:59:47,893 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:59:47,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:59:47,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:59:47,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:59:47,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:59:47,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:59:47,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:59:47,894 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 04:59:48,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:59:48,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:59:48,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:59:48,132 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:59:48,135 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:59:48,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c [2023-12-25 04:59:49,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:59:49,509 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:59:49,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c [2023-12-25 04:59:49,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02cfb59/2c0c1db3fb034687bc843004692b6422/FLAG81c5b846d [2023-12-25 04:59:49,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02cfb59/2c0c1db3fb034687bc843004692b6422 [2023-12-25 04:59:49,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:59:49,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:59:49,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:59:49,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:59:49,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:59:49,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3047727b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49, skipping insertion in model container [2023-12-25 04:59:49,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:59:49,712 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c[458,471] [2023-12-25 04:59:49,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:59:49,745 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:59:49,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound50.c[458,471] [2023-12-25 04:59:49,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:59:49,791 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:59:49,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49 WrapperNode [2023-12-25 04:59:49,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:59:49,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:59:49,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:59:49,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:59:49,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,821 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2023-12-25 04:59:49,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:59:49,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:59:49,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:59:49,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:59:49,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,844 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 04:59:49,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:59:49,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:59:49,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:59:49,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:59:49,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (1/1) ... [2023-12-25 04:59:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:59:49,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:59:49,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 04:59:49,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 04:59:49,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:59:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:59:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:59:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:59:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:59:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:59:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:59:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:59:50,009 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:59:50,014 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:59:50,367 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:59:50,400 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:59:50,401 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:59:50,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:59:50 BoogieIcfgContainer [2023-12-25 04:59:50,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:59:50,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:59:50,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:59:50,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:59:50,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:59:49" (1/3) ... [2023-12-25 04:59:50,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e949bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:59:50, skipping insertion in model container [2023-12-25 04:59:50,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:59:49" (2/3) ... [2023-12-25 04:59:50,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e949bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:59:50, skipping insertion in model container [2023-12-25 04:59:50,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:59:50" (3/3) ... [2023-12-25 04:59:50,415 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound50.c [2023-12-25 04:59:50,428 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:59:50,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:59:50,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:59:50,469 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;@758e114b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:59:50,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:59:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:59:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:59:50,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:59:50,480 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:59:50,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:59:50,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:59:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2023-12-25 04:59:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:59:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577060418] [2023-12-25 04:59:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:59:50,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:59:50,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:59:50,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:59:50,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 04:59:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:59:50,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:59:50,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:59:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 04:59:50,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:59:50,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:59:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577060418] [2023-12-25 04:59:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577060418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:59:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:59:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:59:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536163969] [2023-12-25 04:59:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:59:50,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:59:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:59:50,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:59:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:59:50,728 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:59:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:59:50,753 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2023-12-25 04:59:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:59:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 04:59:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:59:50,764 INFO L225 Difference]: With dead ends: 40 [2023-12-25 04:59:50,764 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 04:59:50,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:59:50,770 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:59:50,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:59:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 04:59:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 04:59:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:59:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-25 04:59:50,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-25 04:59:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:59:50,806 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-25 04:59:50,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:59:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-25 04:59:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:59:50,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:59:50,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:59:50,816 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 04:59:51,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:59:51,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:59:51,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:59:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2023-12-25 04:59:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:59:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207531851] [2023-12-25 04:59:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:59:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:59:51,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:59:51,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:59:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 04:59:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:59:51,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:59:51,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:59:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:59:51,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:59:51,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:59:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207531851] [2023-12-25 04:59:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207531851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:59:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:59:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 04:59:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767526060] [2023-12-25 04:59:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:59:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:59:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:59:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:59:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 04:59:51,329 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:59:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:59:53,762 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-25 04:59:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 04:59:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 04:59:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:59:53,778 INFO L225 Difference]: With dead ends: 30 [2023-12-25 04:59:53,778 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 04:59:53,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 04:59:53,780 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:59:53,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 04:59:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 04:59:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 04:59:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:59:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-25 04:59:53,788 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-25 04:59:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:59:53,789 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-25 04:59:53,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 04:59:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-25 04:59:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 04:59:53,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:59:53,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:59:53,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 04:59:54,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:59:54,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:59:54,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:59:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2023-12-25 04:59:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:59:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392744973] [2023-12-25 04:59:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:59:54,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:59:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:59:54,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:59:54,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 04:59:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:59:54,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 04:59:54,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:59:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:59:54,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:00:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 05:00:13,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:00:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392744973] [2023-12-25 05:00:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392744973] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:00:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:00:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:00:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568886610] [2023-12-25 05:00:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:00:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:00:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:00:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:00:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:00:13,999 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 05:00:17,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:00:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:00:19,781 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-25 05:00:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:00:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-25 05:00:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:00:19,783 INFO L225 Difference]: With dead ends: 32 [2023-12-25 05:00:19,783 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 05:00:19,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:00:19,784 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-25 05:00:19,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-25 05:00:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 05:00:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 05:00:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:00:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-25 05:00:19,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2023-12-25 05:00:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:00:19,797 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-25 05:00:19,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 05:00:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-25 05:00:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 05:00:19,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:00:19,799 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:00:19,824 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 05:00:20,019 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 05:00:20,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:00:20,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:00:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2023-12-25 05:00:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:00:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256549716] [2023-12-25 05:00:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:00:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:00:20,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:00:20,023 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 05:00:20,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 05:00:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:00:20,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:00:20,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:00:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 05:00:21,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:00:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 05:00:36,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:00:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256549716] [2023-12-25 05:00:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256549716] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:00:36,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:00:36,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 05:00:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3195875] [2023-12-25 05:00:36,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:00:36,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 05:00:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:00:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 05:00:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-25 05:00:36,918 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 05:00:41,453 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 05:01:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:01:04,849 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-25 05:01:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 05:01:04,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 35 [2023-12-25 05:01:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:01:04,850 INFO L225 Difference]: With dead ends: 47 [2023-12-25 05:01:04,851 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 05:01:04,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-25 05:01:04,852 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:01:04,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 166 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 13.6s Time] [2023-12-25 05:01:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 05:01:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-25 05:01:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:01:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 05:01:04,870 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2023-12-25 05:01:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:01:04,870 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 05:01:04,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 05:01:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 05:01:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 05:01:04,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:01:04,872 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:01:04,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 05:01:05,084 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 05:01:05,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:01:05,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:01:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 459274687, now seen corresponding path program 2 times [2023-12-25 05:01:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:01:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721650644] [2023-12-25 05:01:05,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:01:05,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:01:05,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:01:05,087 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 05:01:05,088 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 05:01:05,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:01:05,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:01:06,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 05:01:06,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:01:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 05:01:07,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:01:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 05:01:47,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:01:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721650644] [2023-12-25 05:01:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721650644] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:01:47,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:01:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 05:01:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319254720] [2023-12-25 05:01:47,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:01:47,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 05:01:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:01:47,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 05:01:47,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-25 05:01:47,255 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-12-25 05:01:52,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:02:08,546 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:02:33,004 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 05:02:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:02:56,196 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2023-12-25 05:02:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 05:02:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 56 [2023-12-25 05:02:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:02:56,198 INFO L225 Difference]: With dead ends: 65 [2023-12-25 05:02:56,198 INFO L226 Difference]: Without dead ends: 57 [2023-12-25 05:02:56,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2023-12-25 05:02:56,200 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 39 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:02:56,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 327 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2023-12-25 05:02:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-25 05:02:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-25 05:02:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 05:02:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-12-25 05:02:56,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 56 [2023-12-25 05:02:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:02:56,242 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-12-25 05:02:56,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-12-25 05:02:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-12-25 05:02:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 05:02:56,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:02:56,248 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:02:56,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 05:02:56,448 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 05:02:56,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:02:56,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:02:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -507442273, now seen corresponding path program 3 times [2023-12-25 05:02:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:02:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424887646] [2023-12-25 05:02:56,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:02:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:02:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:02:56,460 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 05:02:56,461 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 05:03:01,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 05:03:01,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:03:02,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 05:03:02,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-25 05:03:05,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-25 05:04:34,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424887646] [2023-12-25 05:04:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424887646] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:04:34,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:04:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2023-12-25 05:04:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010212931] [2023-12-25 05:04:34,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:04:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 05:04:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 05:04:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 05:04:34,472 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-12-25 05:05:18,348 WARN L293 SmtUtils]: Spent 13.89s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:05:40,547 WARN L293 SmtUtils]: Spent 12.77s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:06:01,069 WARN L293 SmtUtils]: Spent 14.17s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:06:07,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:26,812 WARN L293 SmtUtils]: Spent 11.30s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:06:44,805 WARN L293 SmtUtils]: Spent 10.70s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:07:03,230 WARN L293 SmtUtils]: Spent 10.90s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:07:16,534 WARN L293 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:07:30,741 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:08:21,086 WARN L293 SmtUtils]: Spent 10.42s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:08:22,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:08:22,848 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2023-12-25 05:08:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-25 05:08:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 98 [2023-12-25 05:08:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:08:22,851 INFO L225 Difference]: With dead ends: 101 [2023-12-25 05:08:22,851 INFO L226 Difference]: Without dead ends: 93 [2023-12-25 05:08:22,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 243.2s TimeCoverageRelationStatistics Valid=706, Invalid=2600, Unknown=0, NotChecked=0, Total=3306 [2023-12-25 05:08:22,853 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 102 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:08:22,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 731 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 44.0s Time] [2023-12-25 05:08:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-25 05:08:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-12-25 05:08:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-25 05:08:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2023-12-25 05:08:22,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 98 [2023-12-25 05:08:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:08:22,926 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2023-12-25 05:08:22,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-12-25 05:08:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2023-12-25 05:08:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-25 05:08:22,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:08:22,928 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 23, 23, 23, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:08:22,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 05:08:23,131 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 05:08:23,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:08:23,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:08:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -159111329, now seen corresponding path program 4 times [2023-12-25 05:08:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:08:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948695553] [2023-12-25 05:08:23,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 05:08:23,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:08:23,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:08:23,134 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 05:08:23,135 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 05:08:31,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 05:08:31,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:08:31,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-25 05:08:31,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:08:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 48 proven. 762 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2023-12-25 05:08:39,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:12:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 48 proven. 759 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2023-12-25 05:12:46,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:12:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948695553] [2023-12-25 05:12:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948695553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:12:46,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:12:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 57 [2023-12-25 05:12:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694555249] [2023-12-25 05:12:46,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:12:46,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-25 05:12:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:12:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-25 05:12:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=2541, Unknown=0, NotChecked=0, Total=3192 [2023-12-25 05:12:46,315 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 57 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 50 states have call successors, (53), 3 states have call predecessors, (53), 2 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) Received shutdown request... [2023-12-25 05:14:27,566 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:14:27,566 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:14:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 05:14:28,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 195.0s TimeCoverageRelationStatistics Valid=1197, Invalid=4809, Unknown=0, NotChecked=0, Total=6006 [2023-12-25 05:14:28,248 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2023-12-25 05:14:28,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1726 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 45.3s Time] [2023-12-25 05:14:28,249 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:14:28,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 05:14:28,460 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 05:14:28,460 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (91states) and FLOYD_HOARE automaton (currently 31 states, 57 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-25-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-24-3-1 context. [2023-12-25 05:14:28,464 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-25 05:14:28,466 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:14:28,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:14:28 BoogieIcfgContainer [2023-12-25 05:14:28,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:14:28,468 INFO L158 Benchmark]: Toolchain (without parser) took 878931.25ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 146.5MB in the beginning and 119.5MB in the end (delta: 27.0MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,468 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 191.9MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:14:28,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.23ms. Allocated memory is still 191.9MB. Free memory was 146.0MB in the beginning and 134.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 191.9MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,469 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 191.9MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,469 INFO L158 Benchmark]: RCFGBuilder took 545.22ms. Allocated memory is still 191.9MB. Free memory was 130.8MB in the beginning and 117.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,470 INFO L158 Benchmark]: TraceAbstraction took 878063.88ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 117.2MB in the beginning and 119.5MB in the end (delta: -2.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2023-12-25 05:14:28,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 191.9MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.23ms. Allocated memory is still 191.9MB. Free memory was 146.0MB in the beginning and 134.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 191.9MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 191.9MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 545.22ms. Allocated memory is still 191.9MB. Free memory was 130.8MB in the beginning and 117.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 878063.88ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 117.2MB in the beginning and 119.5MB in the end (delta: -2.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12). Cancelled while NwaCegarLoop was constructing difference of abstraction (91states) and FLOYD_HOARE automaton (currently 31 states, 57 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-25-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-24-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 878.0s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 435.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 131.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 3091 SdHoareTripleChecker+Invalid, 117.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2867 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 224 mSDtfsCounter, 2478 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 547.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 425.3s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 7088 SizeOfPredicates, 14 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 3102/5030 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