/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/hardness-nfm22/hardness_operatoramount_amount10_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:37:17,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:37:17,564 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 19:37:17,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:37:17,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:37:17,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:37:17,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:37:17,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:37:17,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:37:17,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:37:17,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:37:17,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:37:17,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:37:17,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:37:17,603 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:37:17,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:37:17,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:37:17,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:37:17,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:37:17,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:37:17,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:37:17,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:37:17,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:37:17,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:37:17,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:37:17,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:37:17,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:37:17,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:37:17,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:37:17,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:37:17,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:37:17,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:37:17,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:37:17,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:37:17,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:37:17,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:37:17,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:37:17,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:37:17,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:37:17,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:37:17,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:37:17,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:37:17,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:37:17,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:37:17,612 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 19:37:17,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:37:17,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:37:17,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:37:17,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:37:17,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:37:17,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-05 19:37:19,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:37:19,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:37:19,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-05 19:37:19,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5728f1d2d/0729817429444871b23fdd7e09bc9305/FLAG291d799cc [2024-11-05 19:37:19,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5728f1d2d/0729817429444871b23fdd7e09bc9305 [2024-11-05 19:37:19,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:37:19,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:37:19,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:37:19,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:37:19,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:37:19,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e232516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19, skipping insertion in model container [2024-11-05 19:37:19,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:37:19,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-90.i[915,928] [2024-11-05 19:37:19,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:37:19,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:37:19,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-90.i[915,928] [2024-11-05 19:37:19,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:37:19,739 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:37:19,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19 WrapperNode [2024-11-05 19:37:19,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:37:19,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:37:19,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:37:19,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:37:19,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,771 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-11-05 19:37:19,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:37:19,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:37:19,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:37:19,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:37:19,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,799 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 19:37:19,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:37:19,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:37:19,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:37:19,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:37:19,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (1/1) ... [2024-11-05 19:37:19,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:37:19,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:37:19,855 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 19:37:19,861 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 19:37:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:37:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:37:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:37:19,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:37:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:37:19,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:37:19,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:37:19,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:37:20,190 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-05 19:37:20,190 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:37:20,207 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:37:20,207 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:37:20,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:37:20 BoogieIcfgContainer [2024-11-05 19:37:20,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:37:20,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:37:20,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:37:20,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:37:20,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:37:19" (1/3) ... [2024-11-05 19:37:20,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b19c718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:37:20, skipping insertion in model container [2024-11-05 19:37:20,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:37:19" (2/3) ... [2024-11-05 19:37:20,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b19c718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:37:20, skipping insertion in model container [2024-11-05 19:37:20,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:37:20" (3/3) ... [2024-11-05 19:37:20,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-90.i [2024-11-05 19:37:20,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:37:20,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:37:20,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:37:20,306 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;@71274a0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:37:20,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:37:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 19:37:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 19:37:20,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:37:20,321 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:37:20,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:37:20,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:37:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash -150909191, now seen corresponding path program 1 times [2024-11-05 19:37:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:37:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24526311] [2024-11-05 19:37:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:37:20,337 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 19:37:20,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:37:20,341 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 19:37:20,344 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 19:37:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:37:20,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:37:20,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:37:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-05 19:37:20,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:37:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-05 19:37:20,597 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:37:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24526311] [2024-11-05 19:37:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [24526311] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:37:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:37:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:37:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239731657] [2024-11-05 19:37:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:37:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:37:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:37:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:37:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:37:20,627 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 19:37:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:37:20,644 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2024-11-05 19:37:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:37:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-11-05 19:37:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:37:20,655 INFO L225 Difference]: With dead ends: 59 [2024-11-05 19:37:20,655 INFO L226 Difference]: Without dead ends: 29 [2024-11-05 19:37:20,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:37:20,663 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:37:20,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:37:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-05 19:37:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-05 19:37:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 19:37:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-05 19:37:20,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 54 [2024-11-05 19:37:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:37:20,706 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-05 19:37:20,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 19:37:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-05 19:37:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 19:37:20,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:37:20,710 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:37:20,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 19:37:20,911 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 19:37:20,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:37:20,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:37:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -956776711, now seen corresponding path program 1 times [2024-11-05 19:37:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:37:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954554149] [2024-11-05 19:37:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:37:20,913 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 19:37:20,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:37:20,916 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 19:37:20,918 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 19:37:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:37:21,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 19:37:21,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:37:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 48 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 19:37:24,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:37:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-05 19:37:46,713 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:37:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954554149] [2024-11-05 19:37:46,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [954554149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:37:46,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:37:46,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2024-11-05 19:37:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891806468] [2024-11-05 19:37:46,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:37:46,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-05 19:37:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:37:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-05 19:37:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=728, Unknown=3, NotChecked=0, Total=992 [2024-11-05 19:37:46,718 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 32 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 10 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 19:38:07,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:16,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:20,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:24,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:26,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:30,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:34,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:38,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:38:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:38:39,319 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2024-11-05 19:38:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-05 19:38:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 10 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 54 [2024-11-05 19:38:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:38:39,326 INFO L225 Difference]: With dead ends: 139 [2024-11-05 19:38:39,326 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 19:38:39,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=929, Invalid=2489, Unknown=4, NotChecked=0, Total=3422 [2024-11-05 19:38:39,329 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 108 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 83 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2024-11-05 19:38:39,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 405 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 665 Invalid, 7 Unknown, 0 Unchecked, 37.9s Time] [2024-11-05 19:38:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 19:38:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2024-11-05 19:38:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 19:38:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2024-11-05 19:38:39,371 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 54 [2024-11-05 19:38:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:38:39,372 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2024-11-05 19:38:39,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 10 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 19:38:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2024-11-05 19:38:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-05 19:38:39,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:38:39,374 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:38:39,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 19:38:39,574 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 19:38:39,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:38:39,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:38:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 458194769, now seen corresponding path program 1 times [2024-11-05 19:38:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:38:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056794181] [2024-11-05 19:38:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:38:39,576 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 19:38:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:38:39,579 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 19:38:39,581 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 19:38:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:38:39,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:38:39,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:38:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 19:38:39,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:38:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-05 19:38:40,062 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:38:40,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056794181] [2024-11-05 19:38:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2056794181] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:38:40,062 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:38:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2024-11-05 19:38:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626297644] [2024-11-05 19:38:40,063 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:38:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 19:38:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:38:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 19:38:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-05 19:38:40,064 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-05 19:38:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:38:40,528 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2024-11-05 19:38:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 19:38:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 55 [2024-11-05 19:38:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:38:40,537 INFO L225 Difference]: With dead ends: 151 [2024-11-05 19:38:40,537 INFO L226 Difference]: Without dead ends: 99 [2024-11-05 19:38:40,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-05 19:38:40,539 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:38:40,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 19:38:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-05 19:38:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2024-11-05 19:38:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 19:38:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-05 19:38:40,562 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 55 [2024-11-05 19:38:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:38:40,562 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-05 19:38:40,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-05 19:38:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-05 19:38:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-05 19:38:40,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:38:40,564 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:38:40,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 19:38:40,765 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 19:38:40,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:38:40,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:38:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash 21912416, now seen corresponding path program 1 times [2024-11-05 19:38:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:38:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892480215] [2024-11-05 19:38:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:38:40,767 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 19:38:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:38:40,770 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 19:38:40,772 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 19:38:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:38:41,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 19:38:41,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:38:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 303 proven. 48 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-05 19:38:43,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:38:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-05 19:38:45,746 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:38:45,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892480215] [2024-11-05 19:38:45,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1892480215] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:38:45,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:38:45,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-05 19:38:45,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698875283] [2024-11-05 19:38:45,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:38:45,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 19:38:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:38:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 19:38:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-11-05 19:38:45,749 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 19:38:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:38:47,174 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2024-11-05 19:38:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 19:38:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 105 [2024-11-05 19:38:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:38:47,177 INFO L225 Difference]: With dead ends: 95 [2024-11-05 19:38:47,177 INFO L226 Difference]: Without dead ends: 93 [2024-11-05 19:38:47,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-05 19:38:47,178 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 19:38:47,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 138 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 19:38:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-05 19:38:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-05 19:38:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 19:38:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-05 19:38:47,194 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 105 [2024-11-05 19:38:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:38:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-05 19:38:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 19:38:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-05 19:38:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-05 19:38:47,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:38:47,197 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:38:47,204 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 19:38:47,397 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 19:38:47,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:38:47,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:38:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 732786634, now seen corresponding path program 1 times [2024-11-05 19:38:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:38:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325937992] [2024-11-05 19:38:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:38:47,399 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 19:38:47,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:38:47,400 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 19:38:47,401 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 19:38:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:38:47,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 19:38:47,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:38:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 279 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-05 19:38:49,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:38:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-05 19:38:52,459 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:38:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325937992] [2024-11-05 19:38:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [325937992] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:38:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:38:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-05 19:38:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242083870] [2024-11-05 19:38:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:38:52,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:38:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:38:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:38:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-05 19:38:52,462 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 19:38:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:38:54,918 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2024-11-05 19:38:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:38:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 106 [2024-11-05 19:38:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:38:54,924 INFO L225 Difference]: With dead ends: 92 [2024-11-05 19:38:54,924 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 19:38:54,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-05 19:38:54,925 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 19:38:54,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 19:38:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 19:38:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-11-05 19:38:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 19:38:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2024-11-05 19:38:54,949 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 106 [2024-11-05 19:38:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:38:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2024-11-05 19:38:54,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 19:38:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2024-11-05 19:38:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-05 19:38:54,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:38:54,952 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:38:54,959 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 19:38:55,152 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 19:38:55,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:38:55,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:38:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash 734633676, now seen corresponding path program 1 times [2024-11-05 19:38:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:38:55,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804274886] [2024-11-05 19:38:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:38:55,154 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 19:38:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:38:55,155 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 19:38:55,156 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 19:38:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:38:55,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 19:38:55,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:38:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 279 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-05 19:38:57,336 INFO L311 TraceCheckSpWp]: Computing backward predicates...