/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/feedback_diverge.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:37:59,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:37:59,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:37:59,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:37:59,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:37:59,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:37:59,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:37:59,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:37:59,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:37:59,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:37:59,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:37:59,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:37:59,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:37:59,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:37:59,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:37:59,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:37:59,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:37:59,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:37:59,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:37:59,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:37:59,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:37:59,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:37:59,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:37:59,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:37:59,643 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:37:59,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:37:59,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:37:59,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:37:59,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:37:59,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:37:59,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:37:59,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:37:59,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:37:59,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:37:59,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:37:59,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:37:59,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:37:59,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:37:59,646 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:37:59,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:37:59,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:37:59,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:37:59,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:37:59,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:37:59,648 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:59,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:37:59,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:37:59,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:37:59,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:37:59,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:37:59,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/feedback_diverge.c [2024-11-05 20:38:01,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:38:01,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:38:01,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/feedback_diverge.c [2024-11-05 20:38:01,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc66a398/edc1ca4ff4c64b9ba7a24839b72e873e/FLAG4ad7f1e1d [2024-11-05 20:38:01,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc66a398/edc1ca4ff4c64b9ba7a24839b72e873e [2024-11-05 20:38:01,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:38:01,567 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:38:01,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:38:01,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:38:01,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:38:01,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d4cd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01, skipping insertion in model container [2024-11-05 20:38:01,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:38:01,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/feedback_diverge.c[626,639] [2024-11-05 20:38:01,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:38:01,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:38:01,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/feedback_diverge.c[626,639] [2024-11-05 20:38:01,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:38:01,803 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:38:01,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01 WrapperNode [2024-11-05 20:38:01,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:38:01,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:38:01,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:38:01,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:38:01,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,836 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 48 [2024-11-05 20:38:01,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:38:01,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:38:01,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:38:01,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:38:01,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,858 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]. [2024-11-05 20:38:01,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:38:01,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:38:01,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:38:01,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:38:01,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (1/1) ... [2024-11-05 20:38:01,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:38:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:38:01,907 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) [2024-11-05 20:38:01,909 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 [2024-11-05 20:38:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:38:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:38:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:38:01,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:38:02,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:38:02,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:38:03,896 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-05 20:38:03,896 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:38:03,907 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:38:03,907 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:38:03,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:03 BoogieIcfgContainer [2024-11-05 20:38:03,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:38:03,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:38:03,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:38:03,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:38:03,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:38:01" (1/3) ... [2024-11-05 20:38:03,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07419e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:03, skipping insertion in model container [2024-11-05 20:38:03,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:01" (2/3) ... [2024-11-05 20:38:03,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07419e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:03, skipping insertion in model container [2024-11-05 20:38:03,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:03" (3/3) ... [2024-11-05 20:38:03,917 INFO L112 eAbstractionObserver]: Analyzing ICFG feedback_diverge.c [2024-11-05 20:38:03,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:38:03,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:38:03,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:38:03,981 INFO L333 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, 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;@4fe8b972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:38:03,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:38:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-05 20:38:03,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:03,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-05 20:38:03,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:03,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 889620925, now seen corresponding path program 1 times [2024-11-05 20:38:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:04,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308282223] [2024-11-05 20:38:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:04,002 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 [2024-11-05 20:38:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:04,004 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) [2024-11-05 20:38:04,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 (2)] Waiting until timeout for monitored process [2024-11-05 20:38:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:04,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:38:04,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:04,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:04,169 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308282223] [2024-11-05 20:38:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1308282223] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:38:04,171 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:38:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:38:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766809938] [2024-11-05 20:38:04,174 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:38:04,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:38:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:38:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:38:04,205 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:04,257 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2024-11-05 20:38:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:38:04,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-05 20:38:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:04,265 INFO L225 Difference]: With dead ends: 40 [2024-11-05 20:38:04,266 INFO L226 Difference]: Without dead ends: 21 [2024-11-05 20:38:04,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:38:04,271 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:04,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:38:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-05 20:38:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-05 20:38:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-05 20:38:04,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2024-11-05 20:38:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:04,301 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-05 20:38:04,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-05 20:38:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-05 20:38:04,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:04,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:04,307 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 [2024-11-05 20:38:04,505 WARN L453 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 [2024-11-05 20:38:04,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1044407619, now seen corresponding path program 1 times [2024-11-05 20:38:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166730085] [2024-11-05 20:38:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:04,508 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 [2024-11-05 20:38:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:04,509 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) [2024-11-05 20:38:04,510 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 [2024-11-05 20:38:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:04,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:38:04,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:04,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:04,996 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166730085] [2024-11-05 20:38:04,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166730085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:04,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:04,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:38:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619890001] [2024-11-05 20:38:04,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:04,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:38:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:38:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:38:04,999 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:05,153 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-05 20:38:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:38:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-05 20:38:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:05,155 INFO L225 Difference]: With dead ends: 53 [2024-11-05 20:38:05,155 INFO L226 Difference]: Without dead ends: 49 [2024-11-05 20:38:05,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:38:05,157 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:05,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 92 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:38:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-05 20:38:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-05 20:38:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-05 20:38:05,165 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 16 [2024-11-05 20:38:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:05,165 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-05 20:38:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-05 20:38:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:38:05,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:05,167 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:05,179 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 [2024-11-05 20:38:05,371 WARN L453 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 [2024-11-05 20:38:05,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:05,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash -912393027, now seen corresponding path program 2 times [2024-11-05 20:38:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:05,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605808738] [2024-11-05 20:38:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:05,374 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 [2024-11-05 20:38:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:05,377 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) [2024-11-05 20:38:05,378 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 [2024-11-05 20:38:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:06,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:38:06,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:06,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:06,591 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:06,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605808738] [2024-11-05 20:38:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [605808738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:06,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 20:38:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593546894] [2024-11-05 20:38:06,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:38:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:38:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:38:06,596 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:07,128 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-05 20:38:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 20:38:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-05 20:38:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:07,130 INFO L225 Difference]: With dead ends: 109 [2024-11-05 20:38:07,131 INFO L226 Difference]: Without dead ends: 105 [2024-11-05 20:38:07,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-05 20:38:07,135 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 204 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:07,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 368 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:38:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-05 20:38:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-05 20:38:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-05 20:38:07,154 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 36 [2024-11-05 20:38:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-05 20:38:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-05 20:38:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-05 20:38:07,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:07,159 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:07,187 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 [2024-11-05 20:38:07,360 WARN L453 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 [2024-11-05 20:38:07,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1724629181, now seen corresponding path program 3 times [2024-11-05 20:38:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1386247990] [2024-11-05 20:38:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:07,362 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 [2024-11-05 20:38:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:07,365 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) [2024-11-05 20:38:07,368 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 [2024-11-05 20:38:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:08,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 20:38:08,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:09,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:10,484 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1386247990] [2024-11-05 20:38:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1386247990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:10,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:10,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-05 20:38:10,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129910508] [2024-11-05 20:38:10,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-05 20:38:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-05 20:38:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-05 20:38:10,488 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:12,785 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2024-11-05 20:38:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 20:38:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-05 20:38:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:12,787 INFO L225 Difference]: With dead ends: 221 [2024-11-05 20:38:12,788 INFO L226 Difference]: Without dead ends: 217 [2024-11-05 20:38:12,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 20:38:12,790 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 866 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:12,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1500 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:38:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-05 20:38:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-05 20:38:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.1435185185185186) internal successors, (247), 216 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2024-11-05 20:38:12,806 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 76 [2024-11-05 20:38:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:12,806 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2024-11-05 20:38:12,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2024-11-05 20:38:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-05 20:38:12,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:12,809 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:12,862 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 [2024-11-05 20:38:13,009 WARN L453 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 [2024-11-05 20:38:13,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -722777923, now seen corresponding path program 4 times [2024-11-05 20:38:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2000931262] [2024-11-05 20:38:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:13,012 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 [2024-11-05 20:38:13,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:13,013 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) [2024-11-05 20:38:13,014 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 [2024-11-05 20:38:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:16,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 20:38:16,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:17,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:20,240 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2000931262] [2024-11-05 20:38:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2000931262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:20,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2024-11-05 20:38:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024572512] [2024-11-05 20:38:20,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-05 20:38:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-05 20:38:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2024-11-05 20:38:20,245 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:34,447 INFO L93 Difference]: Finished difference Result 445 states and 538 transitions. [2024-11-05 20:38:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-05 20:38:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-05 20:38:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:34,452 INFO L225 Difference]: With dead ends: 445 [2024-11-05 20:38:34,452 INFO L226 Difference]: Without dead ends: 441 [2024-11-05 20:38:34,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3006, Invalid=5736, Unknown=0, NotChecked=0, Total=8742 [2024-11-05 20:38:34,455 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 3030 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3030 SdHoareTripleChecker+Valid, 6084 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:34,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3030 Valid, 6084 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-05 20:38:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-05 20:38:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-05 20:38:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.143181818181818) internal successors, (503), 440 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 503 transitions. [2024-11-05 20:38:34,490 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 503 transitions. Word has length 156 [2024-11-05 20:38:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 503 transitions. [2024-11-05 20:38:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 503 transitions. [2024-11-05 20:38:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-05 20:38:34,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:34,499 INFO L215 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:34,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 20:38:34,700 WARN L453 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 [2024-11-05 20:38:34,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:34,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1882871997, now seen corresponding path program 5 times [2024-11-05 20:38:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857839763] [2024-11-05 20:38:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:34,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:38:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:34,702 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) [2024-11-05 20:38:34,703 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 [2024-11-05 20:38:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:41,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-05 20:38:41,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:44,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:53,764 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857839763] [2024-11-05 20:38:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1857839763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:53,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 128 [2024-11-05 20:38:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805015751] [2024-11-05 20:38:53,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:53,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-05 20:38:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-05 20:38:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2024-11-05 20:38:53,771 INFO L87 Difference]: Start difference. First operand 441 states and 503 transitions. Second operand has 128 states, 128 states have (on average 4.90625) internal successors, (628), 128 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)