/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/rlim_exit.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:13:34,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:13:34,399 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-03 09:13:34,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:13:34,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:13:34,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:13:34,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:13:34,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:13:34,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:13:34,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:13:34,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:13:34,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:13:34,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:13:34,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:13:34,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:13:34,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:13:34,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:13:34,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:13:34,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:13:34,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:13:34,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:13:34,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:13:34,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:13:34,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:13:34,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:13:34,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:13:34,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:13:34,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:13:34,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:13:34,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:13:34,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:13:34,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:13:34,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:13:34,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:13:34,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:13:34,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:13:34,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:13:34,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:13:34,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:13:34,448 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:13:34,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:13:34,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:13:34,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:13:34,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:13:34,449 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-03 09:13:34,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:13:34,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:13:34,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:13:34,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:13:34,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:13:34,722 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-03 09:13:36,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:13:36,295 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:13:36,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_exit.c [2024-11-03 09:13:36,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dbfe688/81ca0ad83f174dcdac85eb22d437fd1c/FLAG323851add [2024-11-03 09:13:36,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dbfe688/81ca0ad83f174dcdac85eb22d437fd1c [2024-11-03 09:13:36,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:13:36,721 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:13:36,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:13:36,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:13:36,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:13:36,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36, skipping insertion in model container [2024-11-03 09:13:36,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:13:36,899 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-03 09:13:36,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:13:36,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:13:36,931 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-03 09:13:36,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:13:36,951 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:13:36,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36 WrapperNode [2024-11-03 09:13:36,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:13:36,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:13:36,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:13:36,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:13:36,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,980 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-11-03 09:13:36,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:13:36,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:13:36,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:13:36,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:13:36,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:36,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,003 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-03 09:13:37,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:13:37,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:13:37,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:13:37,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:13:37,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (1/1) ... [2024-11-03 09:13:37,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:13:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:13:37,048 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-03 09:13:37,050 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-03 09:13:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:13:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:13:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 09:13:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 09:13:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:13:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:13:37,136 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:13:37,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:13:37,357 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-03 09:13:37,357 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:13:37,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:13:37,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:13:37,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:13:37 BoogieIcfgContainer [2024-11-03 09:13:37,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:13:37,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:13:37,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:13:37,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:13:37,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:13:36" (1/3) ... [2024-11-03 09:13:37,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd70a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:13:37, skipping insertion in model container [2024-11-03 09:13:37,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:13:36" (2/3) ... [2024-11-03 09:13:37,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd70a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:13:37, skipping insertion in model container [2024-11-03 09:13:37,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:13:37" (3/3) ... [2024-11-03 09:13:37,379 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_exit.c [2024-11-03 09:13:37,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:13:37,397 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:13:37,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:13:37,455 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;@5aeddd62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:13:37,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:13:37,458 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-03 09:13:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-03 09:13:37,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:13:37,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-03 09:13:37,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:13:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:13:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 889617946, now seen corresponding path program 1 times [2024-11-03 09:13:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:13:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1482166022] [2024-11-03 09:13:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:13:37,481 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-03 09:13:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:13:37,485 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-03 09:13:37,487 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-03 09:13:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:13:37,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:13:37,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:13:37,611 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-03 09:13:37,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:13:37,632 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-03 09:13:37,633 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:13:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1482166022] [2024-11-03 09:13:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1482166022] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:13:37,635 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:13:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:13:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210331091] [2024-11-03 09:13:37,638 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:13:37,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:13:37,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:13:37,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:13:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:13:37,666 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 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-03 09:13:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:13:37,741 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2024-11-03 09:13:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:13:37,745 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-03 09:13:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:13:37,751 INFO L225 Difference]: With dead ends: 48 [2024-11-03 09:13:37,751 INFO L226 Difference]: Without dead ends: 25 [2024-11-03 09:13:37,754 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-03 09:13:37,763 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:13:37,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:13:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-03 09:13:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-03 09:13:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-03 09:13:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-11-03 09:13:37,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 6 [2024-11-03 09:13:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:13:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-03 09:13:37,808 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-03 09:13:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-11-03 09:13:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-03 09:13:37,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:13:37,812 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-03 09:13:37,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-03 09:13:38,014 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-03 09:13:38,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:13:38,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:13:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash 343707370, now seen corresponding path program 1 times [2024-11-03 09:13:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:13:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650860894] [2024-11-03 09:13:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:13:38,017 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-03 09:13:38,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:13:38,018 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-03 09:13:38,020 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-03 09:13:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:13:38,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:13:38,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:13:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 09:13:38,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:13:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 09:13:38,373 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:13:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650860894] [2024-11-03 09:13:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [650860894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:13:38,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:13:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 09:13:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598516766] [2024-11-03 09:13:38,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:13:38,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 09:13:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:13:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 09:13:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:13:38,379 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:13:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:13:38,535 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2024-11-03 09:13:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:13:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2024-11-03 09:13:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:13:38,538 INFO L225 Difference]: With dead ends: 57 [2024-11-03 09:13:38,538 INFO L226 Difference]: Without dead ends: 53 [2024-11-03 09:13:38,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 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-03 09:13:38,540 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:13:38,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:13:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-03 09:13:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-03 09:13:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-03 09:13:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-03 09:13:38,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 34 [2024-11-03 09:13:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:13:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-03 09:13:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:13:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-03 09:13:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-03 09:13:38,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:13:38,568 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-03 09:13:38,576 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-03 09:13:38,769 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-03 09:13:38,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:13:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:13:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 611428490, now seen corresponding path program 2 times [2024-11-03 09:13:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:13:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878231022] [2024-11-03 09:13:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:13:38,771 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-03 09:13:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:13:38,774 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-03 09:13:38,775 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-03 09:13:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:13:39,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 09:13:39,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:13:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-03 09:13:39,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:13:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-03 09:13:39,478 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:13:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878231022] [2024-11-03 09:13:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [878231022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:13:39,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:13:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 09:13:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488397755] [2024-11-03 09:13:39,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:13:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 09:13:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:13:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 09:13:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-03 09:13:39,486 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-03 09:13:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:13:39,985 INFO L93 Difference]: Finished difference Result 113 states and 175 transitions. [2024-11-03 09:13:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-03 09:13:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 90 [2024-11-03 09:13:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:13:39,988 INFO L225 Difference]: With dead ends: 113 [2024-11-03 09:13:39,988 INFO L226 Difference]: Without dead ends: 109 [2024-11-03 09:13:39,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-03 09:13:39,989 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:13:39,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 522 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 09:13:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-03 09:13:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-03 09:13:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-03 09:13:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2024-11-03 09:13:40,017 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 90 [2024-11-03 09:13:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:13:40,018 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2024-11-03 09:13:40,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-03 09:13:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2024-11-03 09:13:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-03 09:13:40,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:13:40,027 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2024-11-03 09:13:40,037 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-03 09:13:40,231 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-03 09:13:40,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:13:40,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:13:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 187677642, now seen corresponding path program 3 times [2024-11-03 09:13:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:13:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011677290] [2024-11-03 09:13:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:13:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:13:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:13:40,238 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-03 09:13:40,240 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-03 09:13:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:13:40,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-03 09:13:40,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:13:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 09:13:41,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:13:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 09:13:42,022 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:13:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011677290] [2024-11-03 09:13:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011677290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:13:42,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:13:42,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-03 09:13:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405674802] [2024-11-03 09:13:42,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:13:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-03 09:13:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:13:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-03 09:13:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-03 09:13:42,029 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 28 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-03 09:13:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:13:44,235 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2024-11-03 09:13:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-03 09:13:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 28 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) Word has length 202 [2024-11-03 09:13:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:13:44,239 INFO L225 Difference]: With dead ends: 225 [2024-11-03 09:13:44,239 INFO L226 Difference]: Without dead ends: 221 [2024-11-03 09:13:44,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-03 09:13:44,241 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 777 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-03 09:13:44,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1893 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-03 09:13:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-03 09:13:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-03 09:13:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 159 states have (on average 1.3836477987421383) internal successors, (220), 159 states have internal predecessors, (220), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-03 09:13:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 340 transitions. [2024-11-03 09:13:44,270 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 340 transitions. Word has length 202 [2024-11-03 09:13:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:13:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 340 transitions. [2024-11-03 09:13:44,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 28 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 28 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-03 09:13:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 340 transitions. [2024-11-03 09:13:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-03 09:13:44,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:13:44,281 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 60, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2024-11-03 09:13:44,310 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-03 09:13:44,482 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-03 09:13:44,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:13:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:13:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -646225334, now seen corresponding path program 4 times [2024-11-03 09:13:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:13:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861408932] [2024-11-03 09:13:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:13:44,483 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-03 09:13:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:13:44,485 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-03 09:13:44,488 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-03 09:13:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:13:45,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-03 09:13:45,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:13:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2024-11-03 09:13:46,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:13:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2024-11-03 09:13:48,895 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:13:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861408932] [2024-11-03 09:13:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [861408932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:13:48,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:13:48,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2024-11-03 09:13:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037238265] [2024-11-03 09:13:48,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:13:48,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-03 09:13:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:13:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-03 09:13:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2024-11-03 09:13:48,902 INFO L87 Difference]: Start difference. First operand 221 states and 340 transitions. Second operand has 64 states, 64 states have (on average 3.921875) internal successors, (251), 64 states have internal predecessors, (251), 60 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 60 states have call predecessors, (120), 60 states have call successors, (120) [2024-11-03 09:14:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:14:00,062 INFO L93 Difference]: Finished difference Result 449 states and 727 transitions. [2024-11-03 09:14:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-03 09:14:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.921875) internal successors, (251), 64 states have internal predecessors, (251), 60 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 60 states have call predecessors, (120), 60 states have call successors, (120) Word has length 426 [2024-11-03 09:14:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:14:00,068 INFO L225 Difference]: With dead ends: 449 [2024-11-03 09:14:00,068 INFO L226 Difference]: Without dead ends: 445 [2024-11-03 09:14:00,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3006, Invalid=5736, Unknown=0, NotChecked=0, Total=8742 [2024-11-03 09:14:00,072 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 2994 mSDsluCounter, 7008 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2998 SdHoareTripleChecker+Valid, 7296 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:14:00,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2998 Valid, 7296 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3966 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-03 09:14:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-03 09:14:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-11-03 09:14:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 319 states have (on average 1.3918495297805642) internal successors, (444), 319 states have internal predecessors, (444), 124 states have call successors, (124), 1 states have call predecessors, (124), 1 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-03 09:14:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 692 transitions. [2024-11-03 09:14:00,125 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 692 transitions. Word has length 426 [2024-11-03 09:14:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:14:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 692 transitions. [2024-11-03 09:14:00,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.921875) internal successors, (251), 64 states have internal predecessors, (251), 60 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 60 states have call predecessors, (120), 60 states have call successors, (120) [2024-11-03 09:14:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 692 transitions. [2024-11-03 09:14:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2024-11-03 09:14:00,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:14:00,152 INFO L215 NwaCegarLoop]: trace histogram [124, 124, 124, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2024-11-03 09:14:00,200 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-03 09:14:00,353 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-03 09:14:00,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:14:00,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:14:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1521438902, now seen corresponding path program 5 times [2024-11-03 09:14:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:14:00,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530312934] [2024-11-03 09:14:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:14:00,355 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-03 09:14:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:14:00,356 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-03 09:14:00,357 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-03 09:14:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:14:03,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-03 09:14:03,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:14:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 41912 backedges. 0 proven. 11408 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2024-11-03 09:14:05,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:14:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41912 backedges. 0 proven. 11408 refuted. 0 times theorem prover too weak. 30504 trivial. 0 not checked. [2024-11-03 09:14:12,353 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:14:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530312934] [2024-11-03 09:14:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1530312934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:14:12,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:14:12,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 128 [2024-11-03 09:14:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874667197] [2024-11-03 09:14:12,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:14:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-03 09:14:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:14:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-03 09:14:12,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2024-11-03 09:14:12,372 INFO L87 Difference]: Start difference. First operand 445 states and 692 transitions. Second operand has 128 states, 128 states have (on average 3.9609375) internal successors, (507), 128 states have internal predecessors, (507), 124 states have call successors, (248), 1 states have call predecessors, (248), 1 states have return successors, (248), 124 states have call predecessors, (248), 124 states have call successors, (248)