/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-57.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:07:28,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:07:28,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 08:07:28,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:07:28,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:07:28,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:07:28,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:07:28,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:07:28,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:07:28,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:07:28,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:07:28,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:07:28,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:07:28,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:07:28,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:07:28,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:07:28,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:07:28,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:07:28,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:07:28,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:07:28,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:07:28,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:07:28,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:07:28,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:07:28,789 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:07:28,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:07:28,789 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:07:28,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:07:28,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:07:28,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:07:28,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:07:28,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:07:28,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:07:28,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:07:28,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:07:28,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:07:28,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:07:28,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:07:28,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:07:28,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:07:28,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:07:28,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:07:28,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:07:28,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:07:28,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:28,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:07:28,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:07:28,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:07:28,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:07:28,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:07:28,976 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-57.i [2024-11-03 08:07:30,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:07:30,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:07:30,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-57.i [2024-11-03 08:07:30,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24750873/b0a21abb3e654d0a89a584dea3b431ba/FLAG9ead36548 [2024-11-03 08:07:30,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24750873/b0a21abb3e654d0a89a584dea3b431ba [2024-11-03 08:07:30,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:07:30,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:07:30,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:07:30,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:07:30,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:07:30,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8765bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30, skipping insertion in model container [2024-11-03 08:07:30,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:07:30,884 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-57.i[915,928] [2024-11-03 08:07:30,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:07:30,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:07:30,918 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-57.i[915,928] [2024-11-03 08:07:30,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:07:30,937 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:07:30,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30 WrapperNode [2024-11-03 08:07:30,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:07:30,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:07:30,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:07:30,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:07:30,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,963 INFO L138 Inliner]: procedures = 27, calls = 17, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 55 [2024-11-03 08:07:30,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:07:30,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:07:30,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:07:30,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:07:30,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,981 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 08:07:30,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:07:30,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:07:30,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:07:30,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:07:30,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (1/1) ... [2024-11-03 08:07:30,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:07:31,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:07:31,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 08:07:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 08:07:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:07:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:07:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 08:07:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 08:07:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:07:31,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:07:31,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:07:31,102 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:07:31,224 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-03 08:07:31,224 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:07:31,236 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:07:31,236 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 08:07:31,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:07:31 BoogieIcfgContainer [2024-11-03 08:07:31,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:07:31,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:07:31,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:07:31,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:07:31,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:07:30" (1/3) ... [2024-11-03 08:07:31,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b0b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:07:31, skipping insertion in model container [2024-11-03 08:07:31,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:07:30" (2/3) ... [2024-11-03 08:07:31,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b0b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:07:31, skipping insertion in model container [2024-11-03 08:07:31,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:07:31" (3/3) ... [2024-11-03 08:07:31,244 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-57.i [2024-11-03 08:07:31,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:07:31,256 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:07:31,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:07:31,309 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;@4b6d515d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:07:31,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:07:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-03 08:07:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:07:31,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:31,319 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:31,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 948883155, now seen corresponding path program 1 times [2024-11-03 08:07:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:31,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1256187718] [2024-11-03 08:07:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:31,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:31,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-03 08:07:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:31,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:07:31,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-03 08:07:31,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 08:07:31,497 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1256187718] [2024-11-03 08:07:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1256187718] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 08:07:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 08:07:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 08:07:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936764147] [2024-11-03 08:07:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 08:07:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:07:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:31,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:07:31,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:07:31,519 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 08:07:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:31,531 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2024-11-03 08:07:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:07:31,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-03 08:07:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:31,537 INFO L225 Difference]: With dead ends: 47 [2024-11-03 08:07:31,538 INFO L226 Difference]: Without dead ends: 23 [2024-11-03 08:07:31,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-03 08:07:31,544 INFO L432 NwaCegarLoop]: 28 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, 28 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-03 08:07:31,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:07:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-03 08:07:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-03 08:07:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-03 08:07:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-03 08:07:31,571 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 33 [2024-11-03 08:07:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:31,572 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-03 08:07:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 08:07:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-03 08:07:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:07:31,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:31,574 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:31,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-03 08:07:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:31,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash -239266093, now seen corresponding path program 1 times [2024-11-03 08:07:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908909474] [2024-11-03 08:07:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:31,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-03 08:07:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:31,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:31,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-03 08:07:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:31,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 08:07:31,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:32,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:32,519 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:32,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908909474] [2024-11-03 08:07:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1908909474] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:07:32,520 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:07:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2024-11-03 08:07:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147373405] [2024-11-03 08:07:32,520 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:07:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-03 08:07:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-03 08:07:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:07:32,527 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:32,762 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-03 08:07:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 08:07:32,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-11-03 08:07:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:32,764 INFO L225 Difference]: With dead ends: 57 [2024-11-03 08:07:32,764 INFO L226 Difference]: Without dead ends: 55 [2024-11-03 08:07:32,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-11-03 08:07:32,765 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:32,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 223 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:07:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-03 08:07:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2024-11-03 08:07:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 08:07:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-03 08:07:32,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2024-11-03 08:07:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:32,775 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-03 08:07:32,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-03 08:07:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:07:32,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:32,777 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:32,781 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-03 08:07:32,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:32,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:32,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash -241113135, now seen corresponding path program 1 times [2024-11-03 08:07:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654483973] [2024-11-03 08:07:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:32,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:32,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:32,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-03 08:07:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:33,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 08:07:33,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:33,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:33,414 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654483973] [2024-11-03 08:07:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1654483973] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:07:33,414 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:07:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-03 08:07:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27064700] [2024-11-03 08:07:33,415 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:07:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 08:07:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:33,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 08:07:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-03 08:07:33,418 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:33,643 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-03 08:07:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 08:07:33,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-11-03 08:07:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:33,644 INFO L225 Difference]: With dead ends: 47 [2024-11-03 08:07:33,644 INFO L226 Difference]: Without dead ends: 45 [2024-11-03 08:07:33,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-03 08:07:33,646 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:33,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 151 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:07:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-03 08:07:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-03 08:07:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 08:07:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-03 08:07:33,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2024-11-03 08:07:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:33,655 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-03 08:07:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-03 08:07:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:07:33,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:33,656 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:33,661 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-03 08:07:33,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:33,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -182007791, now seen corresponding path program 1 times [2024-11-03 08:07:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127917327] [2024-11-03 08:07:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:33,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:33,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-03 08:07:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:33,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 08:07:33,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:34,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:34,221 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127917327] [2024-11-03 08:07:34,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [127917327] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:07:34,222 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:07:34,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-03 08:07:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43784599] [2024-11-03 08:07:34,222 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:07:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 08:07:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 08:07:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-03 08:07:34,224 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:34,369 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-03 08:07:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:07:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-11-03 08:07:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:34,371 INFO L225 Difference]: With dead ends: 53 [2024-11-03 08:07:34,371 INFO L226 Difference]: Without dead ends: 51 [2024-11-03 08:07:34,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-03 08:07:34,372 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:34,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 258 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:07:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-03 08:07:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2024-11-03 08:07:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 08:07:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-03 08:07:34,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2024-11-03 08:07:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:34,380 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-03 08:07:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-03 08:07:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-03 08:07:34,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:34,381 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:34,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-03 08:07:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:34,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -183854833, now seen corresponding path program 1 times [2024-11-03 08:07:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:34,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778223480] [2024-11-03 08:07:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:34,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:34,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:34,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:34,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-03 08:07:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:34,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:07:34,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-03 08:07:34,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-03 08:07:34,870 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778223480] [2024-11-03 08:07:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1778223480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:07:34,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:07:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-03 08:07:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115740254] [2024-11-03 08:07:34,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:07:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:07:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:34,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:07:34,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:07:34,872 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 08:07:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:35,018 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2024-11-03 08:07:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-03 08:07:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33 [2024-11-03 08:07:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:35,020 INFO L225 Difference]: With dead ends: 108 [2024-11-03 08:07:35,020 INFO L226 Difference]: Without dead ends: 80 [2024-11-03 08:07:35,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:07:35,021 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:35,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:07:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-03 08:07:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2024-11-03 08:07:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-03 08:07:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-11-03 08:07:35,029 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 33 [2024-11-03 08:07:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:35,030 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-11-03 08:07:35,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 08:07:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-11-03 08:07:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-03 08:07:35,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:35,031 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:35,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-03 08:07:35,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:35,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1067661150, now seen corresponding path program 1 times [2024-11-03 08:07:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443811377] [2024-11-03 08:07:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:35,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:35,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:35,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:35,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-03 08:07:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:35,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-03 08:07:35,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-03 08:07:36,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-03 08:07:36,597 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:36,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443811377] [2024-11-03 08:07:36,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1443811377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:07:36,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:07:36,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-03 08:07:36,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840216172] [2024-11-03 08:07:36,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:07:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-03 08:07:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-03 08:07:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-03 08:07:36,599 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-03 08:07:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:37,679 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-11-03 08:07:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-03 08:07:37,680 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 63 [2024-11-03 08:07:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:37,681 INFO L225 Difference]: With dead ends: 138 [2024-11-03 08:07:37,681 INFO L226 Difference]: Without dead ends: 110 [2024-11-03 08:07:37,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2024-11-03 08:07:37,682 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:37,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 155 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:07:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-03 08:07:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-03 08:07:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 08:07:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-03 08:07:37,697 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 63 [2024-11-03 08:07:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:37,697 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-03 08:07:37,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-03 08:07:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-03 08:07:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-03 08:07:37,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:07:37,698 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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-03 08:07:37,702 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 (7)] Forceful destruction successful, exit code 0 [2024-11-03 08:07:37,899 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-03 08:07:37,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:07:37,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:07:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -223655648, now seen corresponding path program 1 times [2024-11-03 08:07:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:07:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614150665] [2024-11-03 08:07:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:07:37,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:07:37,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:07:37,903 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 (8)] Waiting until timeout for monitored process [2024-11-03 08:07:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:07:37,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 08:07:37,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:07:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-03 08:07:38,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:07:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-03 08:07:38,205 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:07:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614150665] [2024-11-03 08:07:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1614150665] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:07:38,205 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:07:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2024-11-03 08:07:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749757357] [2024-11-03 08:07:38,206 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:07:38,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:07:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:07:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:07:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:07:38,207 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:07:38,322 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2024-11-03 08:07:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:07:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2024-11-03 08:07:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:07:38,323 INFO L225 Difference]: With dead ends: 144 [2024-11-03 08:07:38,323 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 08:07:38,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-03 08:07:38,324 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:07:38,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 273 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:07:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 08:07:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 08:07:38,325 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-03 08:07:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 08:07:38,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-11-03 08:07:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:07:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 08:07:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 08:07:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 08:07:38,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 08:07:38,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 08:07:38,331 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 (8)] Ended with exit code 0 [2024-11-03 08:07:38,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:07:38,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:07:38,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 08:07:41,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 08:07:41,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 08:07:41 BoogieIcfgContainer [2024-11-03 08:07:41,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 08:07:41,497 INFO L158 Benchmark]: Toolchain (without parser) took 10752.41ms. Allocated memory is still 375.4MB. Free memory was 332.7MB in the beginning and 323.9MB in the end (delta: 8.8MB). Peak memory consumption was 210.6MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,497 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 08:07:41,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.13ms. Allocated memory is still 375.4MB. Free memory was 332.2MB in the beginning and 319.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.11ms. Allocated memory is still 375.4MB. Free memory was 319.0MB in the beginning and 317.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,498 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 375.4MB. Free memory was 317.5MB in the beginning and 315.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,498 INFO L158 Benchmark]: RCFGBuilder took 244.02ms. Allocated memory is still 375.4MB. Free memory was 314.9MB in the beginning and 303.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,498 INFO L158 Benchmark]: TraceAbstraction took 10257.48ms. Allocated memory is still 375.4MB. Free memory was 302.3MB in the beginning and 323.9MB in the end (delta: -21.6MB). Peak memory consumption was 180.2MB. Max. memory is 8.0GB. [2024-11-03 08:07:41,499 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.09ms. Allocated memory is still 187.7MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.13ms. Allocated memory is still 375.4MB. Free memory was 332.2MB in the beginning and 319.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.11ms. Allocated memory is still 375.4MB. Free memory was 319.0MB in the beginning and 317.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 375.4MB. Free memory was 317.5MB in the beginning and 315.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.02ms. Allocated memory is still 375.4MB. Free memory was 314.9MB in the beginning and 303.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10257.48ms. Allocated memory is still 375.4MB. Free memory was 302.3MB in the beginning and 323.9MB in the end (delta: -21.6MB). Peak memory consumption was 180.2MB. 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 1181 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 953 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 228 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 509 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=6, InterpolantAutomatonStates: 66, 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, 7 MinimizatonAttempts, 76 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 568 ConstructedInterpolants, 52 QuantifiedInterpolants, 2927 SizeOfPredicates, 35 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 668/740 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: 56]: Loop Invariant Derived loop invariant: (((var_1_4 >= 32767) && (var_1_6 == var_1_7)) || ((var_1_4 >= 32767) && (var_1_1 == 32))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_4 >= 32767) || (var_1_6 == var_1_7)) || (var_1_1 == 32)) Ensures: (((0 != cond) && (((var_1_4 >= 32767) || (var_1_6 == var_1_7)) || (var_1_1 == 32))) && ((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (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)))) RESULT: Ultimate proved your program to be correct! [2024-11-03 08:07:41,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...