/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-66.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:17:32,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:17:32,443 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 23:17:32,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:17:32,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:17:32,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:17:32,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:17:32,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:17:32,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:17:32,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:17:32,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:17:32,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:17:32,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:17:32,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:17:32,489 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:17:32,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:17:32,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:17:32,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:17:32,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:17:32,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:17:32,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:17:32,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:17:32,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:17:32,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:17:32,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:17:32,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:17:32,494 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:17:32,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:17:32,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:17:32,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:17:32,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:17:32,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:17:32,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:17:32,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:17:32,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:17:32,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:17:32,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:17:32,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:17:32,498 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:17:32,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:17:32,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:17:32,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:17:32,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:17:32,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:17:32,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:17:32,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:17:32,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:17:32,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:17:32,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:17:32,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:17:32,763 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-66.i [2024-11-05 23:17:34,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:17:34,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:17:34,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-66.i [2024-11-05 23:17:34,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28fc0c4f/71f0d3f088b94037865c40a6b8f5beb3/FLAG2af3a8f01 [2024-11-05 23:17:34,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28fc0c4f/71f0d3f088b94037865c40a6b8f5beb3 [2024-11-05 23:17:34,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:17:34,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:17:34,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:34,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:17:34,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:17:34,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72fc4300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34, skipping insertion in model container [2024-11-05 23:17:34,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:17:34,561 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-66.i[915,928] [2024-11-05 23:17:34,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:34,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:17:34,630 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-66.i[915,928] [2024-11-05 23:17:34,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:34,664 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:17:34,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34 WrapperNode [2024-11-05 23:17:34,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:34,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:34,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:17:34,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:17:34,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,698 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-05 23:17:34,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:34,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:17:34,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:17:34,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:17:34,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,723 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 23:17:34,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:17:34,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:17:34,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:17:34,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:17:34,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (1/1) ... [2024-11-05 23:17:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:17:34,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:17:34,763 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 23:17:34,765 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 23:17:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:17:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:17:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:17:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:17:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:17:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:17:34,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:17:34,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:17:35,021 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-05 23:17:35,021 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:17:35,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:17:35,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:17:35,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:35 BoogieIcfgContainer [2024-11-05 23:17:35,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:17:35,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:17:35,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:17:35,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:17:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:17:34" (1/3) ... [2024-11-05 23:17:35,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd1b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:35, skipping insertion in model container [2024-11-05 23:17:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:34" (2/3) ... [2024-11-05 23:17:35,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd1b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:35, skipping insertion in model container [2024-11-05 23:17:35,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:35" (3/3) ... [2024-11-05 23:17:35,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-66.i [2024-11-05 23:17:35,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:17:35,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:17:35,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:17:35,112 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;@1f38a4ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:17:35,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:17:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 23:17:35,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:35,124 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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 23:17:35,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1560811563, now seen corresponding path program 1 times [2024-11-05 23:17:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976719364] [2024-11-05 23:17:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:35,140 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 23:17:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:35,141 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 23:17:35,143 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 23:17:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:35,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:17:35,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-05 23:17:35,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:35,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976719364] [2024-11-05 23:17:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976719364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:17:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600828168] [2024-11-05 23:17:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:17:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:17:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:17:35,307 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 23:17:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:35,325 INFO L93 Difference]: Finished difference Result 71 states and 114 transitions. [2024-11-05 23:17:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:17:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-11-05 23:17:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:35,336 INFO L225 Difference]: With dead ends: 71 [2024-11-05 23:17:35,336 INFO L226 Difference]: Without dead ends: 35 [2024-11-05 23:17:35,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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 23:17:35,343 INFO L432 NwaCegarLoop]: 47 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, 47 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 23:17:35,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:17:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-05 23:17:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-05 23:17:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-05 23:17:35,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 77 [2024-11-05 23:17:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:35,380 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-05 23:17:35,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 23:17:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-05 23:17:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 23:17:35,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:35,384 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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 23:17:35,391 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 23:17:35,587 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 23:17:35,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 886095829, now seen corresponding path program 1 times [2024-11-05 23:17:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440476171] [2024-11-05 23:17:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:35,590 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 23:17:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:35,592 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 23:17:35,593 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 23:17:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:35,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 23:17:35,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-05 23:17:36,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:36,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:36,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440476171] [2024-11-05 23:17:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440476171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:36,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:17:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173860156] [2024-11-05 23:17:36,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:36,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:17:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:17:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:36,367 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:36,818 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-11-05 23:17:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 23:17:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-11-05 23:17:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:36,822 INFO L225 Difference]: With dead ends: 76 [2024-11-05 23:17:36,822 INFO L226 Difference]: Without dead ends: 74 [2024-11-05 23:17:36,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-05 23:17:36,826 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:36,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:17:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-05 23:17:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-11-05 23:17:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 23:17:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-11-05 23:17:36,858 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 77 [2024-11-05 23:17:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:36,858 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-11-05 23:17:36,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-05 23:17:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 23:17:36,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:36,861 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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 23:17:36,870 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 23:17:37,067 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 23:17:37,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 943354131, now seen corresponding path program 1 times [2024-11-05 23:17:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491005484] [2024-11-05 23:17:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:37,070 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 23:17:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:37,071 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 23:17:37,072 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 23:17:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:37,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 23:17:37,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-05 23:17:37,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:37,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491005484] [2024-11-05 23:17:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491005484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:17:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587623770] [2024-11-05 23:17:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:17:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:17:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:37,636 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:37,984 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-05 23:17:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 23:17:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-11-05 23:17:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:37,987 INFO L225 Difference]: With dead ends: 74 [2024-11-05 23:17:37,987 INFO L226 Difference]: Without dead ends: 72 [2024-11-05 23:17:37,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-05 23:17:37,989 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:37,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 237 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-05 23:17:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-11-05 23:17:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 23:17:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-11-05 23:17:38,001 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 77 [2024-11-05 23:17:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:38,001 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-11-05 23:17:38,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-05 23:17:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-05 23:17:38,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:38,003 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:38,010 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 23:17:38,204 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 23:17:38,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 739302762, now seen corresponding path program 1 times [2024-11-05 23:17:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494170494] [2024-11-05 23:17:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:38,207 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 23:17:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:38,211 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 23:17:38,212 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 23:17:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:38,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 23:17:38,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-11-05 23:17:38,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:38,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494170494] [2024-11-05 23:17:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494170494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:38,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-05 23:17:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729746663] [2024-11-05 23:17:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:38,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:17:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:17:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:17:38,521 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:38,729 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-11-05 23:17:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:17:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 151 [2024-11-05 23:17:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:38,732 INFO L225 Difference]: With dead ends: 76 [2024-11-05 23:17:38,732 INFO L226 Difference]: Without dead ends: 74 [2024-11-05 23:17:38,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:38,733 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:38,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 23:17:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-05 23:17:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-11-05 23:17:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 23:17:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-11-05 23:17:38,743 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 151 [2024-11-05 23:17:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-11-05 23:17:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-05 23:17:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-05 23:17:38,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:38,746 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:38,752 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 23:17:38,946 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 23:17:38,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 796561064, now seen corresponding path program 1 times [2024-11-05 23:17:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563745090] [2024-11-05 23:17:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:38,948 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 23:17:38,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:38,951 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 23:17:38,952 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 23:17:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:39,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 23:17:39,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-11-05 23:17:39,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:39,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563745090] [2024-11-05 23:17:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563745090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-05 23:17:39,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481573258] [2024-11-05 23:17:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:39,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:17:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:17:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:17:39,320 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:39,538 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2024-11-05 23:17:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:17:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 151 [2024-11-05 23:17:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:39,541 INFO L225 Difference]: With dead ends: 70 [2024-11-05 23:17:39,541 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 23:17:39,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:39,545 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:39,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 23:17:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 23:17:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 23:17:39,546 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 23:17:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 23:17:39,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151 [2024-11-05 23:17:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:39,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 23:17:39,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-05 23:17:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 23:17:39,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 23:17:39,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 23:17:39,560 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 23:17:39,754 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 23:17:39,758 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-05 23:17:39,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 23:17:39,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 23:17:39,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 11:17:39 BoogieIcfgContainer [2024-11-05 23:17:39,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 23:17:39,818 INFO L158 Benchmark]: Toolchain (without parser) took 5442.73ms. Allocated memory was 184.5MB in the beginning and 242.2MB in the end (delta: 57.7MB). Free memory was 145.5MB in the beginning and 96.1MB in the end (delta: 49.4MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,818 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 23:17:39,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.75ms. Allocated memory is still 184.5MB. Free memory was 145.3MB in the beginning and 131.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 129.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,819 INFO L158 Benchmark]: Boogie Preprocessor took 38.25ms. Allocated memory is still 184.5MB. Free memory was 129.6MB in the beginning and 127.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,819 INFO L158 Benchmark]: RCFGBuilder took 296.99ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 114.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,819 INFO L158 Benchmark]: TraceAbstraction took 4779.42ms. Allocated memory was 184.5MB in the beginning and 242.2MB in the end (delta: 57.7MB). Free memory was 113.8MB in the beginning and 96.1MB in the end (delta: 17.8MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2024-11-05 23:17:39,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.75ms. Allocated memory is still 184.5MB. Free memory was 145.3MB in the beginning and 131.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 129.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.25ms. Allocated memory is still 184.5MB. Free memory was 129.6MB in the beginning and 127.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 296.99ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 114.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4779.42ms. Allocated memory was 184.5MB in the beginning and 242.2MB in the end (delta: 57.7MB). Free memory was 113.8MB in the beginning and 96.1MB in the end (delta: 17.8MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 720 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 220 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 1120 SizeOfPredicates, 42 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3050/3050 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-05 23:17:39,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...