/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_amount25_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:01:22,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:01:22,332 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:01:22,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:01:22,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:01:22,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:01:22,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:01:22,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:01:22,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:01:22,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:01:22,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:01:22,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:01:22,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:01:22,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:01:22,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:01:22,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:01:22,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:01:22,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:01:22,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:01:22,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:01:22,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:01:22,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:01:22,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:01:22,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:01:22,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:01:22,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:01:22,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:01:22,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:01:22,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:01:22,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:01:22,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:01:22,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:01:22,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:01:22,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:01:22,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:01:22,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:01:22,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:01:22,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:01:22,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:01:22,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:01:22,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:01:22,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:01:22,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:01:22,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:01:22,384 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:01:22,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:01:22,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:01:22,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:01:22,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:01:22,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:01:22,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-05 20:01:24,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:01:24,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:01:24,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-05 20:01:24,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17563f282/e42a591e11474b3d9e8c3f4affb1ecb8/FLAG4f9f1a54d [2024-11-05 20:01:24,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17563f282/e42a591e11474b3d9e8c3f4affb1ecb8 [2024-11-05 20:01:24,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:01:24,660 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:01:24,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:01:24,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:01:24,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:01:24,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:24,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a2620d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24, skipping insertion in model container [2024-11-05 20:01:24,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:24,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:01:24,864 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_amount25_file-90.i[915,928] [2024-11-05 20:01:24,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:01:24,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:01:24,930 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_amount25_file-90.i[915,928] [2024-11-05 20:01:24,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:01:24,972 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:01:24,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24 WrapperNode [2024-11-05 20:01:24,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:01:24,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:01:24,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:01:24,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:01:24,983 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:01:24" (1/1) ... [2024-11-05 20:01:25,000 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:01:24" (1/1) ... [2024-11-05 20:01:25,042 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-05 20:01:25,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:01:25,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:01:25,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:01:25,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:01:25,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,072 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:01:25,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:01:25,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:01:25,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:01:25,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:01:25,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (1/1) ... [2024-11-05 20:01:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:01:25,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:01:25,128 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:01:25,131 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:01:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:01:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:01:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:01:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:01:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:01:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:01:25,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:01:25,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:01:25,564 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-05 20:01:25,564 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:01:25,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:01:25,578 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:01:25,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:01:25 BoogieIcfgContainer [2024-11-05 20:01:25,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:01:25,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:01:25,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:01:25,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:01:25,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:01:24" (1/3) ... [2024-11-05 20:01:25,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5963b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:01:25, skipping insertion in model container [2024-11-05 20:01:25,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:01:24" (2/3) ... [2024-11-05 20:01:25,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5963b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:01:25, skipping insertion in model container [2024-11-05 20:01:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:01:25" (3/3) ... [2024-11-05 20:01:25,594 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2024-11-05 20:01:25,617 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:01:25,617 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:01:25,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:01:25,709 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;@61e1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:01:25,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:01:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-05 20:01:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 20:01:25,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:01:25,731 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:01:25,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:01:25,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:01:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1387335848, now seen corresponding path program 1 times [2024-11-05 20:01:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:01:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1661541592] [2024-11-05 20:01:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:01:25,752 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:01:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:01:25,756 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:01:25,762 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:01:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:01:25,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:01:25,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:01:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-05 20:01:26,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:01:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-05 20:01:26,169 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:01:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1661541592] [2024-11-05 20:01:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1661541592] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:01:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:01:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 20:01:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826925541] [2024-11-05 20:01:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:01:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:01:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:01:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:01:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:01:26,207 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 20:01:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:01:26,241 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-05 20:01:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:01:26,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-05 20:01:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:01:26,251 INFO L225 Difference]: With dead ends: 95 [2024-11-05 20:01:26,251 INFO L226 Difference]: Without dead ends: 47 [2024-11-05 20:01:26,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 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 20:01:26,258 INFO L432 NwaCegarLoop]: 68 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, 68 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 20:01:26,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:01:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-05 20:01:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-05 20:01:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-05 20:01:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-05 20:01:26,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2024-11-05 20:01:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:01:26,330 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-05 20:01:26,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 20:01:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-05 20:01:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 20:01:26,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:01:26,334 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:01:26,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:01:26,535 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:01:26,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:01:26,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:01:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2101967718, now seen corresponding path program 1 times [2024-11-05 20:01:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:01:26,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68489382] [2024-11-05 20:01:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:01:26,537 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:01:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:01:26,542 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:01:26,543 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:01:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:01:26,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 20:01:26,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:01:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:01:30,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:01:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:01:39,947 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:01:39,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68489382] [2024-11-05 20:01:39,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [68489382] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:01:39,947 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:01:39,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 24 [2024-11-05 20:01:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537630100] [2024-11-05 20:01:39,948 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:01:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-05 20:01:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:01:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-05 20:01:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-05 20:01:39,951 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-05 20:01:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:01:50,161 INFO L93 Difference]: Finished difference Result 217 states and 296 transitions. [2024-11-05 20:01:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-05 20:01:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 107 [2024-11-05 20:01:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:01:50,166 INFO L225 Difference]: With dead ends: 217 [2024-11-05 20:01:50,166 INFO L226 Difference]: Without dead ends: 215 [2024-11-05 20:01:50,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=734, Invalid=2688, Unknown=0, NotChecked=0, Total=3422 [2024-11-05 20:01:50,172 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 496 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:01:50,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 586 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-05 20:01:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-05 20:01:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 159. [2024-11-05 20:01:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 95 states have internal predecessors, (110), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-05 20:01:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 226 transitions. [2024-11-05 20:01:50,230 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 226 transitions. Word has length 107 [2024-11-05 20:01:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:01:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 226 transitions. [2024-11-05 20:01:50,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-05 20:01:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 226 transitions. [2024-11-05 20:01:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 20:01:50,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:01:50,237 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:01:50,243 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:01:50,442 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:01:50,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:01:50,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:01:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash 331001653, now seen corresponding path program 1 times [2024-11-05 20:01:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:01:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866512089] [2024-11-05 20:01:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:01:50,444 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:01:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:01:50,446 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:01:50,446 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:01:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:01:50,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 20:01:50,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:01:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-05 20:01:53,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:02:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:02:01,488 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:02:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866512089] [2024-11-05 20:02:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [866512089] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:02:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:02:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-05 20:02:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629885618] [2024-11-05 20:02:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:02:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 20:02:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:02:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 20:02:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-05 20:02:01,492 INFO L87 Difference]: Start difference. First operand 159 states and 226 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:02:03,535 INFO L93 Difference]: Finished difference Result 193 states and 259 transitions. [2024-11-05 20:02:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:02:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-05 20:02:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:02:03,539 INFO L225 Difference]: With dead ends: 193 [2024-11-05 20:02:03,539 INFO L226 Difference]: Without dead ends: 191 [2024-11-05 20:02:03,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2024-11-05 20:02:03,541 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 165 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:02:03,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 358 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 20:02:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-05 20:02:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 95. [2024-11-05 20:02:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-05 20:02:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-11-05 20:02:03,574 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 108 [2024-11-05 20:02:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:02:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-11-05 20:02:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-05 20:02:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-05 20:02:03,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:02:03,578 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:02:03,583 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:02:03,778 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:02:03,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:02:03,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:02:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785787, now seen corresponding path program 1 times [2024-11-05 20:02:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:02:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870040095] [2024-11-05 20:02:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:02:03,780 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:02:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:02:03,784 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:02:03,785 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:02:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:02:03,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-05 20:02:03,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:02:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-05 20:02:07,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:02:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:02:16,364 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:02:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870040095] [2024-11-05 20:02:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [870040095] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:02:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:02:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [35] total 48 [2024-11-05 20:02:16,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780448919] [2024-11-05 20:02:16,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:02:16,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:02:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:02:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:02:16,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2024-11-05 20:02:16,367 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:02:20,404 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2024-11-05 20:02:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:02:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-05 20:02:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:02:20,407 INFO L225 Difference]: With dead ends: 138 [2024-11-05 20:02:20,407 INFO L226 Difference]: Without dead ends: 136 [2024-11-05 20:02:20,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=446, Invalid=2416, Unknown=0, NotChecked=0, Total=2862 [2024-11-05 20:02:20,409 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 188 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:02:20,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 182 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-05 20:02:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-05 20:02:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2024-11-05 20:02:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-05 20:02:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2024-11-05 20:02:20,456 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 109 [2024-11-05 20:02:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:02:20,457 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2024-11-05 20:02:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2024-11-05 20:02:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-05 20:02:20,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:02:20,461 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:02:20,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:02:20,661 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:02:20,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:02:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:02:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632829, now seen corresponding path program 1 times [2024-11-05 20:02:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:02:20,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898002166] [2024-11-05 20:02:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:02:20,663 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:02:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:02:20,664 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:02:20,666 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:02:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:02:20,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 20:02:20,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:02:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-05 20:02:23,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:02:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:02:34,869 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:02:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898002166] [2024-11-05 20:02:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1898002166] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:02:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:02:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-05 20:02:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685183205] [2024-11-05 20:02:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:02:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 20:02:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:02:34,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 20:02:34,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2024-11-05 20:02:34,872 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:02:39,039 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2024-11-05 20:02:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:02:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-05 20:02:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:02:39,041 INFO L225 Difference]: With dead ends: 119 [2024-11-05 20:02:39,041 INFO L226 Difference]: Without dead ends: 117 [2024-11-05 20:02:39,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-05 20:02:39,043 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 189 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:02:39,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 345 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-05 20:02:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-05 20:02:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-11-05 20:02:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-05 20:02:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2024-11-05 20:02:39,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 109 [2024-11-05 20:02:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:02:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2024-11-05 20:02:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 20:02:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2024-11-05 20:02:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-05 20:02:39,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:02:39,078 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 20:02:39,083 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 (6)] Forceful destruction successful, exit code 0 [2024-11-05 20:02:39,278 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:02:39,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:02:39,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:02:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1039758777, now seen corresponding path program 1 times [2024-11-05 20:02:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:02:39,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [561030010] [2024-11-05 20:02:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:02:39,280 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:02:39,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:02:39,281 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:02:39,282 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:02:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:02:39,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:02:39,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:02:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-05 20:02:39,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:02:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 20:02:39,518 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:02:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [561030010] [2024-11-05 20:02:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [561030010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:02:39,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:02:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-05 20:02:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882599948] [2024-11-05 20:02:39,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:02:39,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 20:02:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:02:39,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 20:02:39,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:02:39,520 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-05 20:02:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:02:39,920 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2024-11-05 20:02:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:02:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 109 [2024-11-05 20:02:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:02:39,921 INFO L225 Difference]: With dead ends: 182 [2024-11-05 20:02:39,921 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:02:39,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-05 20:02:39,923 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 112 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:02:39,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 139 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:02:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:02:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:02:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:02:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:02:39,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-11-05 20:02:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:02:39,925 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:02:39,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-05 20:02:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:02:39,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:02:39,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:02:39,934 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 (7)] Ended with exit code 0 [2024-11-05 20:02:40,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:02:40,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-05 20:02:40,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:02:49,300 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 436 DAG size of output: 14 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)