/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/divmul_diverge.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:37:25,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:37:25,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:37:25,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:37:25,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:37:25,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:37:25,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:37:25,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:37:25,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:37:25,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:37:25,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:37:25,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:37:25,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:37:25,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:37:25,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:37:25,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:37:25,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:37:25,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:37:25,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:37:25,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:37:25,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:37:25,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:37:25,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:37:25,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:37:25,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:37:25,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:37:25,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:37:25,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:37:25,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:37:25,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:37:25,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:37:25,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:37:25,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:37:25,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:37:25,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:37:25,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:37:25,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:37:25,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:37:25,135 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:25,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:37:25,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:37:25,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:37:25,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:37:25,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:37:25,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/divmul_diverge.c [2024-11-05 20:37:26,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:37:26,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:37:26,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/divmul_diverge.c [2024-11-05 20:37:26,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3579ff75/2b3f543ab1d0465fb701506b3487a3f0/FLAGeca2eb1b3 [2024-11-05 20:37:27,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3579ff75/2b3f543ab1d0465fb701506b3487a3f0 [2024-11-05 20:37:27,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:37:27,259 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:37:27,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:37:27,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:37:27,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:37:27,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aa810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27, skipping insertion in model container [2024-11-05 20:37:27,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:37:27,442 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/divmul_diverge.c[613,626] [2024-11-05 20:37:27,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:37:27,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:37:27,475 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/divmul_diverge.c[613,626] [2024-11-05 20:37:27,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:37:27,491 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:37:27,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27 WrapperNode [2024-11-05 20:37:27,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:37:27,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:37:27,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:37:27,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:37:27,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,517 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 44 [2024-11-05 20:37:27,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:37:27,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:37:27,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:37:27,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:37:27,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 20:37:27,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:37:27,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:37:27,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:37:27,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:37:27,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (1/1) ... [2024-11-05 20:37:27,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:37:27,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:37:27,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:37:27,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:37:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:37:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:37:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:37:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:37:27,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:37:27,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:37:28,576 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-05 20:37:28,576 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:37:28,585 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:37:28,585 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:37:28,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:37:28 BoogieIcfgContainer [2024-11-05 20:37:28,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:37:28,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:37:28,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:37:28,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:37:28,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:37:27" (1/3) ... [2024-11-05 20:37:28,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e382f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:37:28, skipping insertion in model container [2024-11-05 20:37:28,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:37:27" (2/3) ... [2024-11-05 20:37:28,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e382f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:37:28, skipping insertion in model container [2024-11-05 20:37:28,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:37:28" (3/3) ... [2024-11-05 20:37:28,594 INFO L112 eAbstractionObserver]: Analyzing ICFG divmul_diverge.c [2024-11-05 20:37:28,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:37:28,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:37:28,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:37:28,656 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;@50384b69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:37:28,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:37:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-05 20:37:28,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:37:28,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-05 20:37:28,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:37:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:37:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 889620925, now seen corresponding path program 1 times [2024-11-05 20:37:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:37:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033792532] [2024-11-05 20:37:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:37:28,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:28,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:37:28,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:37:28,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 20:37:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:37:28,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:37:28,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:37:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:28,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:37:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:28,826 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:37:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033792532] [2024-11-05 20:37:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1033792532] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:37:28,827 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:37:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:37:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112538146] [2024-11-05 20:37:28,829 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:37:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:37:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:37:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:37:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:37:28,848 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:37:28,900 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2024-11-05 20:37:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:37:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-05 20:37:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:37:28,908 INFO L225 Difference]: With dead ends: 40 [2024-11-05 20:37:28,908 INFO L226 Difference]: Without dead ends: 21 [2024-11-05 20:37:28,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:37:28,914 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:37:28,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:37:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-05 20:37:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-05 20:37:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-05 20:37:28,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2024-11-05 20:37:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:37:28,941 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-05 20:37:28,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-05 20:37:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-05 20:37:28,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:37:28,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 20:37:28,946 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 (2)] Forceful destruction successful, exit code 0 [2024-11-05 20:37:29,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:29,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:37:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:37:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1044407619, now seen corresponding path program 1 times [2024-11-05 20:37:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:37:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166974318] [2024-11-05 20:37:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:37:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:37:29,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:37:29,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 20:37:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:37:29,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:37:29,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:37:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:29,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:37:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:29,671 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:37:29,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166974318] [2024-11-05 20:37:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166974318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:37:29,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:37:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:37:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444861550] [2024-11-05 20:37:29,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:37:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:37:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:37:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:37:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:37:29,674 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:37:29,780 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-05 20:37:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:37:29,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-05 20:37:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:37:29,781 INFO L225 Difference]: With dead ends: 53 [2024-11-05 20:37:29,781 INFO L226 Difference]: Without dead ends: 49 [2024-11-05 20:37:29,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:37:29,782 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:37:29,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 92 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:37:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-05 20:37:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-05 20:37:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-05 20:37:29,788 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 16 [2024-11-05 20:37:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:37:29,789 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-05 20:37:29,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-05 20:37:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:37:29,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:37:29,790 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-05 20:37:29,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:37:29,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:29,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:37:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:37:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash -912393027, now seen corresponding path program 2 times [2024-11-05 20:37:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:37:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801148876] [2024-11-05 20:37:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:37:29,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:29,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:37:29,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:37:29,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 20:37:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:37:31,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:37:31,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:37:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:31,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:37:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:31,483 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:37:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801148876] [2024-11-05 20:37:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1801148876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:37:31,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:37:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 20:37:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605707806] [2024-11-05 20:37:31,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:37:31,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:37:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:37:31,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:37:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:37:31,485 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:37:31,945 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-05 20:37:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 20:37:31,947 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-05 20:37:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:37:31,948 INFO L225 Difference]: With dead ends: 109 [2024-11-05 20:37:31,948 INFO L226 Difference]: Without dead ends: 105 [2024-11-05 20:37:31,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-05 20:37:31,950 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 204 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:37:31,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 368 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:37:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-05 20:37:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-05 20:37:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-05 20:37:31,968 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 36 [2024-11-05 20:37:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:37:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-05 20:37:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-05 20:37:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-05 20:37:31,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:37:31,970 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2024-11-05 20:37:31,997 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-05 20:37:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:32,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:37:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:37:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1724629181, now seen corresponding path program 3 times [2024-11-05 20:37:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:37:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321581712] [2024-11-05 20:37:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:37:32,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:37:32,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:37:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:37:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:37:34,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 20:37:34,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:37:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:35,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:37:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:36,036 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:37:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321581712] [2024-11-05 20:37:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1321581712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:37:36,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:37:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-05 20:37:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648233243] [2024-11-05 20:37:36,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:37:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-05 20:37:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:37:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-05 20:37:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-05 20:37:36,039 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:37:38,276 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2024-11-05 20:37:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 20:37:38,279 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-05 20:37:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:37:38,281 INFO L225 Difference]: With dead ends: 221 [2024-11-05 20:37:38,282 INFO L226 Difference]: Without dead ends: 217 [2024-11-05 20:37:38,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 20:37:38,283 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 866 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:37:38,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1500 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:37:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-05 20:37:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-05 20:37:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.1435185185185186) internal successors, (247), 216 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2024-11-05 20:37:38,305 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 76 [2024-11-05 20:37:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:37:38,305 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2024-11-05 20:37:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:37:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2024-11-05 20:37:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-05 20:37:38,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:37:38,312 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2024-11-05 20:37:38,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 20:37:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:38,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:37:38,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:37:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash -722777923, now seen corresponding path program 4 times [2024-11-05 20:37:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:37:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994608846] [2024-11-05 20:37:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:37:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:37:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:37:38,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:37:38,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:37:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:37:43,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 20:37:43,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:37:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:44,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:37:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:37:48,118 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:37:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994608846] [2024-11-05 20:37:48,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1994608846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:37:48,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:37:48,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2024-11-05 20:37:48,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163334514] [2024-11-05 20:37:48,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:37:48,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-05 20:37:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:37:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-05 20:37:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2024-11-05 20:37:48,122 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:01,957 INFO L93 Difference]: Finished difference Result 445 states and 538 transitions. [2024-11-05 20:38:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-05 20:38:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-05 20:38:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:01,959 INFO L225 Difference]: With dead ends: 445 [2024-11-05 20:38:01,959 INFO L226 Difference]: Without dead ends: 441 [2024-11-05 20:38:01,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=3006, Invalid=5736, Unknown=0, NotChecked=0, Total=8742 [2024-11-05 20:38:01,962 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 3030 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3030 SdHoareTripleChecker+Valid, 6084 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:01,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3030 Valid, 6084 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 20:38:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-05 20:38:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-05 20:38:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.143181818181818) internal successors, (503), 440 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 503 transitions. [2024-11-05 20:38:01,993 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 503 transitions. Word has length 156 [2024-11-05 20:38:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:01,993 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 503 transitions. [2024-11-05 20:38:01,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.8125) internal successors, (308), 64 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 503 transitions. [2024-11-05 20:38:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-05 20:38:01,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:01,997 INFO L215 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:02,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 20:38:02,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:38:02,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1882871997, now seen corresponding path program 5 times [2024-11-05 20:38:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852881421] [2024-11-05 20:38:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:02,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:38:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:02,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:38:02,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 20:38:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:13,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-05 20:38:13,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:17,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:28,980 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852881421] [2024-11-05 20:38:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1852881421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:38:28,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:38:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 128 [2024-11-05 20:38:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589951146] [2024-11-05 20:38:28,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:38:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-05 20:38:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-05 20:38:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2024-11-05 20:38:28,997 INFO L87 Difference]: Start difference. First operand 441 states and 503 transitions. Second operand has 128 states, 128 states have (on average 4.90625) internal successors, (628), 128 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)