/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_amount250_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:12:32,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:12:32,695 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:12:32,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:12:32,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:12:32,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:12:32,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:12:32,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:12:32,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:12:32,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:12:32,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:12:32,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:12:32,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:12:32,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:12:32,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:12:32,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:12:32,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:12:32,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:12:32,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:12:32,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:12:32,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:12:32,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:12:32,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:12:32,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:12:32,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:12:32,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:12:32,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:12:32,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:12:32,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:12:32,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:12:32,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:12:32,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:12:32,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:12:32,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:12:32,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:12:32,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:12:32,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:12:32,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:12:32,742 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:12:32,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:12:32,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:12:32,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:12:32,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:12:32,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:12:32,743 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:12:32,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:12:32,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:12:32,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:12:32,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:12:32,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:12:32,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-30.i [2024-11-03 08:12:34,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:12:34,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:12:34,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-30.i [2024-11-03 08:12:34,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f10e3af/26ce5e5966584b12b1ba19b2765118fc/FLAG3b5cf951e [2024-11-03 08:12:34,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f10e3af/26ce5e5966584b12b1ba19b2765118fc [2024-11-03 08:12:34,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:12:34,617 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:12:34,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:12:34,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:12:34,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:12:34,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:12:34" (1/1) ... [2024-11-03 08:12:34,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa5992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:34, skipping insertion in model container [2024-11-03 08:12:34,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:12:34" (1/1) ... [2024-11-03 08:12:34,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:12:34,833 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_amount250_file-30.i[916,929] [2024-11-03 08:12:35,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:12:35,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:12:35,059 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_amount250_file-30.i[916,929] [2024-11-03 08:12:35,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:12:35,152 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:12:35,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35 WrapperNode [2024-11-03 08:12:35,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:12:35,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:12:35,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:12:35,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:12:35,161 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:12:35" (1/1) ... [2024-11-03 08:12:35,179 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:12:35" (1/1) ... [2024-11-03 08:12:35,242 INFO L138 Inliner]: procedures = 27, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 342 [2024-11-03 08:12:35,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:12:35,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:12:35,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:12:35,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:12:35,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,290 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:12:35,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:12:35,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:12:35,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:12:35,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:12:35,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (1/1) ... [2024-11-03 08:12:35,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:12:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:12:35,373 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:12:35,376 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:12:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:12:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:12:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 08:12:35,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 08:12:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:12:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:12:35,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:12:35,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:12:43,941 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-03 08:12:43,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:12:43,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:12:43,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 08:12:43,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:12:43 BoogieIcfgContainer [2024-11-03 08:12:43,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:12:43,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:12:43,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:12:43,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:12:43,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:12:34" (1/3) ... [2024-11-03 08:12:43,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f7d53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:12:43, skipping insertion in model container [2024-11-03 08:12:43,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:12:35" (2/3) ... [2024-11-03 08:12:43,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f7d53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:12:43, skipping insertion in model container [2024-11-03 08:12:43,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:12:43" (3/3) ... [2024-11-03 08:12:43,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-30.i [2024-11-03 08:12:43,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:12:43,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:12:44,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:12:44,058 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;@66e68e3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:12:44,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:12:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-03 08:12:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-03 08:12:44,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:12:44,098 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:12:44,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:12:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:12:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1154907571, now seen corresponding path program 1 times [2024-11-03 08:12:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:12:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [850516198] [2024-11-03 08:12:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:12:44,115 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:12:44,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:12:44,119 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:12:44,121 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:12:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:12:44,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:12:44,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:12:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1974 proven. 0 refuted. 0 times theorem prover too weak. 3330 trivial. 0 not checked. [2024-11-03 08:12:45,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:12:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2024-11-03 08:12:47,119 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:12:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [850516198] [2024-11-03 08:12:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [850516198] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 08:12:47,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 08:12:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 08:12:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314499278] [2024-11-03 08:12:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 08:12:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:12:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:12:47,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:12:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:12:47,157 INFO L87 Difference]: Start difference. First operand has 147 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-03 08:12:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:12:47,195 INFO L93 Difference]: Finished difference Result 287 states and 524 transitions. [2024-11-03 08:12:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:12:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 328 [2024-11-03 08:12:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:12:47,208 INFO L225 Difference]: With dead ends: 287 [2024-11-03 08:12:47,208 INFO L226 Difference]: Without dead ends: 143 [2024-11-03 08:12:47,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 654 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:12:47,215 INFO L432 NwaCegarLoop]: 231 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, 231 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:12:47,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:12:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-03 08:12:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-03 08:12:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-03 08:12:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 231 transitions. [2024-11-03 08:12:47,271 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 231 transitions. Word has length 328 [2024-11-03 08:12:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:12:47,272 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 231 transitions. [2024-11-03 08:12:47,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-03 08:12:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 231 transitions. [2024-11-03 08:12:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-03 08:12:47,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:12:47,284 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:12:47,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 08:12:47,484 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:12:47,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:12:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:12:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1728280095, now seen corresponding path program 1 times [2024-11-03 08:12:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:12:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877395875] [2024-11-03 08:12:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:12:47,487 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:12:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:12:47,491 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:12:47,492 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:12:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:12:48,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:12:48,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:12:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-03 08:12:54,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:12:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-03 08:12:57,836 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:12:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877395875] [2024-11-03 08:12:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [877395875] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:12:57,836 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:12:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-03 08:12:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062391127] [2024-11-03 08:12:57,837 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:12:57,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:12:57,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:12:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:12:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:12:57,842 INFO L87 Difference]: Start difference. First operand 143 states and 231 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2024-11-03 08:13:00,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:13:01,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:05,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:09,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:13:13,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:17,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:22,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:13:26,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:30,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:34,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 08:13:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:13:34,207 INFO L93 Difference]: Finished difference Result 476 states and 775 transitions. [2024-11-03 08:13:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 08:13:34,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 330 [2024-11-03 08:13:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:13:34,277 INFO L225 Difference]: With dead ends: 476 [2024-11-03 08:13:34,277 INFO L226 Difference]: Without dead ends: 336 [2024-11-03 08:13:34,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:13:34,279 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 336 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 209 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:13:34,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 982 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 36.2s Time] [2024-11-03 08:13:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-03 08:13:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 281. [2024-11-03 08:13:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 174 states have (on average 1.4310344827586208) internal successors, (249), 174 states have internal predecessors, (249), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-03 08:13:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 457 transitions. [2024-11-03 08:13:34,346 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 457 transitions. Word has length 330 [2024-11-03 08:13:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:13:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 457 transitions. [2024-11-03 08:13:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2024-11-03 08:13:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 457 transitions. [2024-11-03 08:13:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-03 08:13:34,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:13:34,354 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:13:34,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-03 08:13:34,555 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:13:34,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:13:34,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:13:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1907155679, now seen corresponding path program 1 times [2024-11-03 08:13:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:13:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1485175056] [2024-11-03 08:13:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:13:34,557 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:13:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:13:34,558 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:13:34,559 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:13:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:13:35,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 08:13:35,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:13:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2241 proven. 108 refuted. 0 times theorem prover too weak. 2955 trivial. 0 not checked. [2024-11-03 08:13:39,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:13:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2024-11-03 08:13:43,302 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:13:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1485175056] [2024-11-03 08:13:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1485175056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:13:43,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:13:43,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-03 08:13:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621434505] [2024-11-03 08:13:43,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:13:43,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 08:13:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:13:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 08:13:43,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:13:43,306 INFO L87 Difference]: Start difference. First operand 281 states and 457 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (88), 2 states have call predecessors, (88), 4 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2024-11-03 08:13:50,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:54,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:58,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 08:13:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:13:58,714 INFO L93 Difference]: Finished difference Result 573 states and 921 transitions. [2024-11-03 08:13:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 08:13:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (88), 2 states have call predecessors, (88), 4 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 330 [2024-11-03 08:13:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:13:58,805 INFO L225 Difference]: With dead ends: 573 [2024-11-03 08:13:58,805 INFO L226 Difference]: Without dead ends: 295 [2024-11-03 08:13:58,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-03 08:13:58,809 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 96 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:13:58,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 410 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 278 Invalid, 3 Unknown, 0 Unchecked, 15.0s Time] [2024-11-03 08:13:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-03 08:13:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 287. [2024-11-03 08:13:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 178 states have (on average 1.398876404494382) internal successors, (249), 178 states have internal predecessors, (249), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-03 08:13:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 457 transitions. [2024-11-03 08:13:58,863 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 457 transitions. Word has length 330 [2024-11-03 08:13:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:13:58,866 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 457 transitions. [2024-11-03 08:13:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (88), 2 states have call predecessors, (88), 4 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2024-11-03 08:13:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 457 transitions. [2024-11-03 08:13:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-03 08:13:58,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:13:58,870 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:13:58,900 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:13:59,070 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:13:59,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:13:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:13:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -9623329, now seen corresponding path program 1 times [2024-11-03 08:13:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:13:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935495786] [2024-11-03 08:13:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:13:59,073 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:13:59,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:13:59,074 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:13:59,075 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:13:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:13:59,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 08:13:59,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:14:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1513 proven. 24 refuted. 0 times theorem prover too weak. 3767 trivial. 0 not checked. [2024-11-03 08:14:01,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:14:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 129 proven. 24 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2024-11-03 08:14:05,179 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:14:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935495786] [2024-11-03 08:14:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [935495786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:14:05,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:14:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-03 08:14:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840663254] [2024-11-03 08:14:05,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:14:05,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 08:14:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:14:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 08:14:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:14:05,182 INFO L87 Difference]: Start difference. First operand 287 states and 457 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61)