/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_amount100_file-36.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:24:06,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:24:06,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:24:06,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:24:06,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:24:06,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:24:06,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:24:06,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:24:06,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:24:06,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:24:06,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:24:06,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:24:06,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:24:06,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:24:06,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:24:06,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:24:06,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:24:06,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:24:06,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:24:06,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:24:06,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:24:06,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:24:06,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:24:06,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:24:06,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:24:06,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:24:06,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:24:06,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:24:06,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:24:06,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:24:06,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:24:06,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:24:06,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:24:06,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:24:06,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:24:06,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:24:06,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:24:06,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:24:06,902 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:24:06,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:24:06,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:24:06,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:24:06,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:24:06,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:24:06,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:07,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:24:07,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:24:07,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:24:07,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:24:07,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:24:07,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-36.i [2024-11-05 19:24:08,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:24:08,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:24:08,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-36.i [2024-11-05 19:24:08,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e730d5/fba3b65363804fe58279cb05c5e95179/FLAG719f9ef49 [2024-11-05 19:24:08,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e730d5/fba3b65363804fe58279cb05c5e95179 [2024-11-05 19:24:08,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:24:08,896 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:24:08,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:24:08,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:24:08,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:24:08,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:24:08" (1/1) ... [2024-11-05 19:24:08,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b49af8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:08, skipping insertion in model container [2024-11-05 19:24:08,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:24:08" (1/1) ... [2024-11-05 19:24:08,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:24:09,098 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_amount100_file-36.i[916,929] [2024-11-05 19:24:09,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:24:09,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:24:09,195 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_amount100_file-36.i[916,929] [2024-11-05 19:24:09,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:24:09,283 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:24:09,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09 WrapperNode [2024-11-05 19:24:09,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:24:09,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:24:09,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:24:09,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:24:09,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,349 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-05 19:24:09,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:24:09,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:24:09,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:24:09,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:24:09,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 19:24:09,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:24:09,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:24:09,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:24:09,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:24:09,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (1/1) ... [2024-11-05 19:24:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:24:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:24:09,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 19:24:09,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 19:24:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:24:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:24:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:24:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:24:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:24:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:24:09,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:24:09,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:24:14,310 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-05 19:24:14,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:24:14,330 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:24:14,331 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:24:14,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:24:14 BoogieIcfgContainer [2024-11-05 19:24:14,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:24:14,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:24:14,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:24:14,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:24:14,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:24:08" (1/3) ... [2024-11-05 19:24:14,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7e3a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:24:14, skipping insertion in model container [2024-11-05 19:24:14,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:24:09" (2/3) ... [2024-11-05 19:24:14,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7e3a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:24:14, skipping insertion in model container [2024-11-05 19:24:14,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:24:14" (3/3) ... [2024-11-05 19:24:14,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-36.i [2024-11-05 19:24:14,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:24:14,355 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:24:14,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:24:14,419 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;@2998ef17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:24:14,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:24:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-05 19:24:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-05 19:24:14,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:24:14,437 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:24:14,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:24:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:24:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1568810157, now seen corresponding path program 1 times [2024-11-05 19:24:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:24:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872070170] [2024-11-05 19:24:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:24:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:14,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:24:14,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:24:14,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 19:24:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:24:14,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:24:14,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:24:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-11-05 19:24:14,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:24:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2024-11-05 19:24:15,451 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:24:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872070170] [2024-11-05 19:24:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872070170] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:24:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:24:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:24:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642484659] [2024-11-05 19:24:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:24:15,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:24:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:24:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:24:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:24:15,490 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-05 19:24:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:24:15,528 INFO L93 Difference]: Finished difference Result 175 states and 306 transitions. [2024-11-05 19:24:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:24:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-05 19:24:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:24:15,542 INFO L225 Difference]: With dead ends: 175 [2024-11-05 19:24:15,542 INFO L226 Difference]: Without dead ends: 87 [2024-11-05 19:24:15,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:24:15,552 INFO L432 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:24:15,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:24:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-05 19:24:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-05 19:24:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-05 19:24:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-11-05 19:24:15,605 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 183 [2024-11-05 19:24:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:24:15,606 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-11-05 19:24:15,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-05 19:24:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-11-05 19:24:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-05 19:24:15,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:24:15,614 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:24:15,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 19:24:15,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:15,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:24:15,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:24:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1525949237, now seen corresponding path program 1 times [2024-11-05 19:24:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:24:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804736500] [2024-11-05 19:24:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:24:15,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:15,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:24:15,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:24:15,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 19:24:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:24:16,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 19:24:16,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:24:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-05 19:24:16,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:24:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-05 19:24:17,114 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:24:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804736500] [2024-11-05 19:24:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [804736500] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:24:17,114 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:24:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2024-11-05 19:24:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495197235] [2024-11-05 19:24:17,115 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:24:17,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 19:24:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:24:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 19:24:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 19:24:17,119 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-05 19:24:21,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:24:24,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:24:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:24:25,546 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-05 19:24:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 19:24:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-05 19:24:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:24:25,551 INFO L225 Difference]: With dead ends: 255 [2024-11-05 19:24:25,551 INFO L226 Difference]: Without dead ends: 171 [2024-11-05 19:24:25,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 19:24:25,554 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 115 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-05 19:24:25,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 478 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2024-11-05 19:24:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-05 19:24:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 87. [2024-11-05 19:24:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-05 19:24:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-05 19:24:25,589 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 183 [2024-11-05 19:24:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:24:25,592 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-05 19:24:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-05 19:24:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-05 19:24:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-05 19:24:25,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:24:25,597 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:24:25,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 19:24:25,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:25,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:24:25,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:24:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 113287978, now seen corresponding path program 1 times [2024-11-05 19:24:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:24:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684416014] [2024-11-05 19:24:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:24:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:24:25,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:24:25,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 19:24:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:24:26,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 19:24:26,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:24:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-05 19:24:26,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:24:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-05 19:24:27,699 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:24:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684416014] [2024-11-05 19:24:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1684416014] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:24:27,699 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:24:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 19:24:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646684987] [2024-11-05 19:24:27,700 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:24:27,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 19:24:27,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:24:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 19:24:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 19:24:27,705 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-05 19:24:33,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:24:37,453 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-05 19:24:40,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:24:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:24:40,608 INFO L93 Difference]: Finished difference Result 178 states and 270 transitions. [2024-11-05 19:24:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 19:24:40,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-11-05 19:24:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:24:40,661 INFO L225 Difference]: With dead ends: 178 [2024-11-05 19:24:40,661 INFO L226 Difference]: Without dead ends: 94 [2024-11-05 19:24:40,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-05 19:24:40,664 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 248 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 217 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:24:40,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 224 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2024-11-05 19:24:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-05 19:24:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-05 19:24:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-05 19:24:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2024-11-05 19:24:40,684 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 184 [2024-11-05 19:24:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:24:40,686 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2024-11-05 19:24:40,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-05 19:24:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2024-11-05 19:24:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-05 19:24:40,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:24:40,689 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:24:40,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 19:24:40,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:40,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:24:40,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:24:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 115135020, now seen corresponding path program 1 times [2024-11-05 19:24:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:24:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273538592] [2024-11-05 19:24:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:24:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:24:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:24:40,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:24:40,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 19:24:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:24:41,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:24:41,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:24:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2024-11-05 19:24:50,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:25:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 144 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-11-05 19:25:33,588 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:25:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273538592] [2024-11-05 19:25:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1273538592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:25:33,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:25:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-05 19:25:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798678314] [2024-11-05 19:25:33,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:25:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 19:25:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:25:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 19:25:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-05 19:25:33,591 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 6 states have call successors, (56), 4 states have call predecessors, (56), 8 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56)