/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/rlim_exit.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 00:22:38,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 00:22:38,687 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-06 00:22:38,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 00:22:38,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 00:22:38,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 00:22:38,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 00:22:38,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 00:22:38,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 00:22:38,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 00:22:38,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 00:22:38,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 00:22:38,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 00:22:38,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 00:22:38,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 00:22:38,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 00:22:38,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 00:22:38,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 00:22:38,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 00:22:38,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 00:22:38,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 00:22:38,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 00:22:38,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 00:22:38,727 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 00:22:38,727 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 00:22:38,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 00:22:38,728 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 00:22:38,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 00:22:38,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 00:22:38,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 00:22:38,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 00:22:38,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 00:22:38,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 00:22:38,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 00:22:38,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:22:38,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 00:22:38,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 00:22:38,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 00:22:38,730 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 00:22:38,730 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 00:22:38,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 00:22:38,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 00:22:38,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 00:22:38,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 00:22:38,731 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 00:22:38,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 00:22:38,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 00:22:38,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 00:22:38,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 00:22:38,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 00:22:38,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/rlim_exit.c [2024-11-06 00:22:40,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 00:22:40,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 00:22:40,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_exit.c [2024-11-06 00:22:40,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e83195cb/b0b53f5c4e444285b5343db7d0a8f2f9/FLAG022194ed1 [2024-11-06 00:22:40,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e83195cb/b0b53f5c4e444285b5343db7d0a8f2f9 [2024-11-06 00:22:40,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 00:22:40,898 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 00:22:40,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 00:22:40,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 00:22:40,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 00:22:40,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:40" (1/1) ... [2024-11-06 00:22:40,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b28279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:40, skipping insertion in model container [2024-11-06 00:22:40,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:40" (1/1) ... [2024-11-06 00:22:40,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 00:22:41,057 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/rlim_exit.c[446,459] [2024-11-06 00:22:41,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:22:41,080 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 00:22:41,089 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/rlim_exit.c[446,459] [2024-11-06 00:22:41,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:22:41,105 INFO L204 MainTranslator]: Completed translation [2024-11-06 00:22:41,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41 WrapperNode [2024-11-06 00:22:41,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 00:22:41,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 00:22:41,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 00:22:41,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 00:22:41,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,142 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-11-06 00:22:41,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 00:22:41,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 00:22:41,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 00:22:41,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 00:22:41,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,167 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-06 00:22:41,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 00:22:41,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 00:22:41,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 00:22:41,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 00:22:41,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (1/1) ... [2024-11-06 00:22:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:22:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 00:22:41,231 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-06 00:22:41,246 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-06 00:22:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 00:22:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 00:22:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 00:22:41,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 00:22:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 00:22:41,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 00:22:41,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 00:22:41,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 00:22:41,612 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-06 00:22:41,612 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 00:22:41,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 00:22:41,633 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 00:22:41,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:41 BoogieIcfgContainer [2024-11-06 00:22:41,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 00:22:41,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 00:22:41,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 00:22:41,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 00:22:41,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:40" (1/3) ... [2024-11-06 00:22:41,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e9b8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:41, skipping insertion in model container [2024-11-06 00:22:41,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41" (2/3) ... [2024-11-06 00:22:41,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e9b8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:41, skipping insertion in model container [2024-11-06 00:22:41,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:41" (3/3) ... [2024-11-06 00:22:41,643 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_exit.c [2024-11-06 00:22:41,668 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 00:22:41,668 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 00:22:41,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 00:22:41,732 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;@cf13c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 00:22:41,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 00:22:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 00:22:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-06 00:22:41,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:41,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-06 00:22:41,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash 889617946, now seen corresponding path program 1 times [2024-11-06 00:22:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137591625] [2024-11-06 00:22:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:41,764 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-06 00:22:41,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:41,769 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-06 00:22:41,769 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-06 00:22:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:41,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 00:22:41,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:41,873 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-06 00:22:41,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:22:41,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137591625] [2024-11-06 00:22:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137591625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:22:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:22:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 00:22:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142690441] [2024-11-06 00:22:41,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:22:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 00:22:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 00:22:41,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:22:41,901 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 00:22:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:41,931 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2024-11-06 00:22:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 00:22:41,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 00:22:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:41,939 INFO L225 Difference]: With dead ends: 47 [2024-11-06 00:22:41,939 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 00:22:41,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:22:41,946 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:41,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 00:22:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 00:22:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2024-11-06 00:22:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 00:22:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-06 00:22:41,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 6 [2024-11-06 00:22:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:41,974 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-06 00:22:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 00:22:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-06 00:22:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 00:22:41,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:41,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:41,983 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-06 00:22:42,176 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-06 00:22:42,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1329688190, now seen corresponding path program 1 times [2024-11-06 00:22:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454822486] [2024-11-06 00:22:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:22:42,179 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-06 00:22:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:42,182 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-06 00:22:42,183 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-06 00:22:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:22:42,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 00:22:42,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 00:22:42,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:22:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 00:22:42,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:42,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454822486] [2024-11-06 00:22:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454822486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:22:42,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:22:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 00:22:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45201322] [2024-11-06 00:22:42,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:22:42,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 00:22:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 00:22:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 00:22:42,386 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 00:22:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:42,470 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2024-11-06 00:22:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 00:22:42,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-06 00:22:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:42,472 INFO L225 Difference]: With dead ends: 43 [2024-11-06 00:22:42,472 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 00:22:42,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 00:22:42,473 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:42,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 00:22:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 00:22:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 00:22:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 00:22:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-06 00:22:42,488 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 20 [2024-11-06 00:22:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:42,488 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-06 00:22:42,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 00:22:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2024-11-06 00:22:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-06 00:22:42,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:42,492 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:42,497 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-06 00:22:42,692 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-06 00:22:42,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1445218234, now seen corresponding path program 2 times [2024-11-06 00:22:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159750651] [2024-11-06 00:22:42,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 00:22:42,694 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-06 00:22:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:42,697 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-06 00:22:42,698 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-06 00:22:42,896 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 00:22:42,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:22:42,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 00:22:42,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 00:22:43,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:22:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-06 00:22:43,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159750651] [2024-11-06 00:22:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159750651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:22:43,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:22:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 00:22:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618486266] [2024-11-06 00:22:43,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:22:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 00:22:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:43,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 00:22:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-06 00:22:43,244 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-06 00:22:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:43,536 INFO L93 Difference]: Finished difference Result 85 states and 129 transitions. [2024-11-06 00:22:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 00:22:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 62 [2024-11-06 00:22:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:43,539 INFO L225 Difference]: With dead ends: 85 [2024-11-06 00:22:43,539 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 00:22:43,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-11-06 00:22:43,543 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 117 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:43,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 259 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 00:22:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 00:22:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-06 00:22:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-06 00:22:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2024-11-06 00:22:43,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 62 [2024-11-06 00:22:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:43,561 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2024-11-06 00:22:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-06 00:22:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2024-11-06 00:22:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-06 00:22:43,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:43,566 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:43,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 00:22:43,767 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-06 00:22:43,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:43,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1026727382, now seen corresponding path program 3 times [2024-11-06 00:22:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733984818] [2024-11-06 00:22:43,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 00:22:43,770 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-06 00:22:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:43,774 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-06 00:22:43,776 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-06 00:22:45,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-06 00:22:45,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:22:45,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 00:22:45,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-06 00:22:45,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:22:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-06 00:22:46,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733984818] [2024-11-06 00:22:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733984818] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:22:46,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:22:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-06 00:22:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812639369] [2024-11-06 00:22:46,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:22:46,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 00:22:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:46,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 00:22:46,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2024-11-06 00:22:46,657 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 20 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-06 00:22:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:47,732 INFO L93 Difference]: Finished difference Result 169 states and 267 transitions. [2024-11-06 00:22:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 00:22:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 20 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) Word has length 146 [2024-11-06 00:22:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:47,737 INFO L225 Difference]: With dead ends: 169 [2024-11-06 00:22:47,737 INFO L226 Difference]: Without dead ends: 165 [2024-11-06 00:22:47,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2024-11-06 00:22:47,740 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 504 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:47,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1056 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 00:22:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-06 00:22:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-06 00:22:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-06 00:22:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2024-11-06 00:22:47,768 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 252 transitions. Word has length 146 [2024-11-06 00:22:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 252 transitions. [2024-11-06 00:22:47,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 20 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-06 00:22:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 252 transitions. [2024-11-06 00:22:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-06 00:22:47,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:47,774 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:47,791 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-06 00:22:47,974 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-06 00:22:47,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash 680021770, now seen corresponding path program 4 times [2024-11-06 00:22:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570485775] [2024-11-06 00:22:47,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 00:22:47,977 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-06 00:22:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:47,982 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-06 00:22:47,998 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-06 00:22:49,077 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 00:22:49,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:22:49,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 00:22:49,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:22:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-06 00:22:49,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:22:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-06 00:22:51,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:22:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570485775] [2024-11-06 00:22:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570485775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:22:51,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:22:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2024-11-06 00:22:51,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863129786] [2024-11-06 00:22:51,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:22:51,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-06 00:22:51,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:22:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-06 00:22:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2024-11-06 00:22:51,065 INFO L87 Difference]: Start difference. First operand 165 states and 252 transitions. Second operand has 48 states, 48 states have (on average 3.8958333333333335) internal successors, (187), 48 states have internal predecessors, (187), 44 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 44 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-06 00:22:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:22:56,513 INFO L93 Difference]: Finished difference Result 337 states and 543 transitions. [2024-11-06 00:22:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-06 00:22:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.8958333333333335) internal successors, (187), 48 states have internal predecessors, (187), 44 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 44 states have call predecessors, (88), 44 states have call successors, (88) Word has length 314 [2024-11-06 00:22:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:22:56,517 INFO L225 Difference]: With dead ends: 337 [2024-11-06 00:22:56,517 INFO L226 Difference]: Without dead ends: 333 [2024-11-06 00:22:56,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2024-11-06 00:22:56,519 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1737 mSDsluCounter, 3859 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 00:22:56,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 4075 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 00:22:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-06 00:22:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-06 00:22:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 239 states have (on average 1.389121338912134) internal successors, (332), 239 states have internal predecessors, (332), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-06 00:22:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 516 transitions. [2024-11-06 00:22:56,552 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 516 transitions. Word has length 314 [2024-11-06 00:22:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:22:56,553 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 516 transitions. [2024-11-06 00:22:56,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.8958333333333335) internal successors, (187), 48 states have internal predecessors, (187), 44 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 44 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-06 00:22:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 516 transitions. [2024-11-06 00:22:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2024-11-06 00:22:56,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:22:56,569 INFO L215 NwaCegarLoop]: trace histogram [92, 92, 92, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2024-11-06 00:22:56,607 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-06 00:22:56,772 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-06 00:22:56,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:22:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:22:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1781598410, now seen corresponding path program 5 times [2024-11-06 00:22:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:22:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564261686] [2024-11-06 00:22:56,775 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 00:22:56,775 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-06 00:22:56,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:22:56,778 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-06 00:22:56,779 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-06 00:23:55,748 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2024-11-06 00:23:55,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:23:55,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-06 00:23:55,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:23:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 23000 backedges. 0 proven. 6256 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2024-11-06 00:23:57,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:24:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 23000 backedges. 0 proven. 6256 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2024-11-06 00:24:03,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:24:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564261686] [2024-11-06 00:24:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564261686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:24:03,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:24:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 97 [2024-11-06 00:24:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867276413] [2024-11-06 00:24:03,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:24:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-11-06 00:24:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:24:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-06 00:24:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2448, Invalid=6864, Unknown=0, NotChecked=0, Total=9312 [2024-11-06 00:24:03,406 INFO L87 Difference]: Start difference. First operand 333 states and 516 transitions. Second operand has 97 states, 97 states have (on average 3.9072164948453607) internal successors, (379), 97 states have internal predecessors, (379), 92 states have call successors, (184), 1 states have call predecessors, (184), 1 states have return successors, (184), 92 states have call predecessors, (184), 92 states have call successors, (184)