/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-91.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:02:26,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:02:26,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 06:02:26,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:02:26,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:02:26,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:02:26,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:02:26,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:02:26,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:02:26,983 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:02:26,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:02:26,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:02:26,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:02:26,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:02:26,985 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:02:26,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:02:26,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:02:26,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:02:26,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:02:26,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:02:26,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:02:26,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:02:26,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:02:26,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:02:26,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:02:26,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:02:26,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:02:26,992 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:02:26,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:02:26,992 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:02:26,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:02:26,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:02:26,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:02:26,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:02:26,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:02:26,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:02:26,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:02:26,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:02:26,994 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:02:26,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:02:26,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:02:26,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:02:26,995 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:02:26,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:02:26,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:02:26,996 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:02:26,996 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 [2023-12-24 06:02:27,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:02:27,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:02:27,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:02:27,229 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:02:27,229 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:02:27,230 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-91.i [2023-12-24 06:02:28,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:02:28,268 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-24 06:02:28,389 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:02:28,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2023-12-24 06:02:28,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d53b37a8/782c8290508c4ff1945f7d8bab59aadb/FLAG1324c1617 [2023-12-24 06:02:28,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d53b37a8/782c8290508c4ff1945f7d8bab59aadb [2023-12-24 06:02:28,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:02:28,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:02:28,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:02:28,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:02:28,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:02:28,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e57666e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28, skipping insertion in model container [2023-12-24 06:02:28,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,451 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:02:28,571 WARN L239 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-91.i[916,929] [2023-12-24 06:02:28,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:02:28,662 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:02:28,670 WARN L239 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-91.i[916,929] [2023-12-24 06:02:28,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:02:28,726 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:02:28,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28 WrapperNode [2023-12-24 06:02:28,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:02:28,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:02:28,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:02:28,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:02:28,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,784 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2023-12-24 06:02:28,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:02:28,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:02:28,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:02:28,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:02:28,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,810 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]. [2023-12-24 06:02:28,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:02:28,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:02:28,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:02:28,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:02:28,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (1/1) ... [2023-12-24 06:02:28,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:02:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:02:28,858 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) [2023-12-24 06:02:28,868 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 [2023-12-24 06:02:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:02:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:02:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:02:28,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:02:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:02:28,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:02:28,939 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:02:28,940 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:02:55,477 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:02:55,525 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:02:55,525 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:02:55,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:02:55 BoogieIcfgContainer [2023-12-24 06:02:55,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:02:55,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:02:55,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:02:55,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:02:55,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:02:28" (1/3) ... [2023-12-24 06:02:55,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f070ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:02:55, skipping insertion in model container [2023-12-24 06:02:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:02:28" (2/3) ... [2023-12-24 06:02:55,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f070ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:02:55, skipping insertion in model container [2023-12-24 06:02:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:02:55" (3/3) ... [2023-12-24 06:02:55,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-91.i [2023-12-24 06:02:55,552 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:02:55,553 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:02:55,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:02:55,595 INFO L357 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, mHoare=true, 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;@37432c4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:02:55,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:02:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 06:02:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 06:02:55,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:02:55,608 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:02:55,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:02:55,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:02:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1265559604, now seen corresponding path program 1 times [2023-12-24 06:02:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:02:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724981793] [2023-12-24 06:02:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:02:55,621 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 [2023-12-24 06:02:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:02:55,626 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) [2023-12-24 06:02:55,657 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 [2023-12-24 06:02:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:02:56,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:02:56,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:02:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2023-12-24 06:02:56,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:02:56,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:02:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724981793] [2023-12-24 06:02:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724981793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:02:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:02:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:02:56,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121423247] [2023-12-24 06:02:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:02:56,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:02:56,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:02:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:02:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:02:56,868 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 06:03:01,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:03:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:03:01,689 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2023-12-24 06:03:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:03:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-24 06:03:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:03:01,991 INFO L225 Difference]: With dead ends: 147 [2023-12-24 06:03:01,991 INFO L226 Difference]: Without dead ends: 73 [2023-12-24 06:03:01,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:03:01,996 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 06:03:01,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 06:03:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-24 06:03:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-24 06:03:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 06:03:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2023-12-24 06:03:02,031 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 161 [2023-12-24 06:03:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:03:02,032 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2023-12-24 06:03:02,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 06:03:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2023-12-24 06:03:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 06:03:02,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:03:02,035 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:03:02,064 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 [2023-12-24 06:03:02,255 WARN L477 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 [2023-12-24 06:03:02,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:03:02,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:03:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -982126838, now seen corresponding path program 1 times [2023-12-24 06:03:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:03:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119004910] [2023-12-24 06:03:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:03:02,258 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 [2023-12-24 06:03:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:03:02,265 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) [2023-12-24 06:03:02,266 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 [2023-12-24 06:03:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:03:03,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 06:03:03,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:03:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-12-24 06:03:04,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:03:04,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:03:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119004910] [2023-12-24 06:03:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119004910] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:03:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1230923762] [2023-12-24 06:03:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:03:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 06:03:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 06:03:04,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 06:03:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-24 06:03:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:03:06,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 06:03:06,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:03:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-12-24 06:03:07,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:03:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1230923762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:03:07,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:03:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-12-24 06:03:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041406711] [2023-12-24 06:03:07,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:03:07,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 06:03:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:03:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 06:03:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 06:03:07,398 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 06:03:10,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:03:15,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:03:19,401 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 [] [2023-12-24 06:03:23,406 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 [] [2023-12-24 06:03:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:03:23,411 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2023-12-24 06:03:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 06:03:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2023-12-24 06:03:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:03:23,811 INFO L225 Difference]: With dead ends: 151 [2023-12-24 06:03:23,811 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 06:03:23,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-24 06:03:23,813 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2023-12-24 06:03:23,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 191 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2023-12-24 06:03:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 06:03:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-12-24 06:03:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 06:03:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2023-12-24 06:03:23,827 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 161 [2023-12-24 06:03:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:03:23,828 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2023-12-24 06:03:23,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 06:03:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2023-12-24 06:03:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-24 06:03:23,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:03:23,831 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:03:23,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-24 06:03:24,094 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 [2023-12-24 06:03:24,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 [2023-12-24 06:03:24,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:03:24,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:03:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash 375952993, now seen corresponding path program 1 times [2023-12-24 06:03:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:03:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927410483] [2023-12-24 06:03:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:03:24,258 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 [2023-12-24 06:03:24,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:03:24,260 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) [2023-12-24 06:03:24,287 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 [2023-12-24 06:03:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:03:26,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 06:03:26,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:03:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2023-12-24 06:03:31,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:03:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 75 proven. 66 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-12-24 06:03:35,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:03:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927410483] [2023-12-24 06:03:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927410483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 06:03:35,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:03:35,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 06:03:35,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119451977] [2023-12-24 06:03:35,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:03:35,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 06:03:35,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:03:35,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 06:03:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-24 06:03:35,545 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-24 06:03:45,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:03:49,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:03:53,815 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 [] [2023-12-24 06:03:57,830 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 [] [2023-12-24 06:04:01,844 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 [] [2023-12-24 06:04:05,867 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 [] [2023-12-24 06:04:09,882 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 [] [2023-12-24 06:04:13,889 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 [] [2023-12-24 06:04:17,903 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 [] [2023-12-24 06:04:21,906 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 [] [2023-12-24 06:04:25,917 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 [] [2023-12-24 06:04:29,934 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 [] [2023-12-24 06:04:33,939 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 [] [2023-12-24 06:04:37,951 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 [] [2023-12-24 06:04:41,967 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 [] [2023-12-24 06:04:45,980 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 [] [2023-12-24 06:04:50,000 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 [] [2023-12-24 06:04:54,010 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 [] [2023-12-24 06:05:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:05:03,626 INFO L93 Difference]: Finished difference Result 359 states and 516 transitions. [2023-12-24 06:05:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-24 06:05:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 162 [2023-12-24 06:05:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:05:03,630 INFO L225 Difference]: With dead ends: 359 [2023-12-24 06:05:03,631 INFO L226 Difference]: Without dead ends: 283 [2023-12-24 06:05:03,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=500, Invalid=1306, Unknown=0, NotChecked=0, Total=1806 [2023-12-24 06:05:03,633 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 381 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 294 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.3s IncrementalHoareTripleChecker+Time [2023-12-24 06:05:03,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 672 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 654 Invalid, 18 Unknown, 0 Unchecked, 83.3s Time] [2023-12-24 06:05:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-24 06:05:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 183. [2023-12-24 06:05:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-24 06:05:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 260 transitions. [2023-12-24 06:05:03,666 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 260 transitions. Word has length 162 [2023-12-24 06:05:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:05:03,667 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 260 transitions. [2023-12-24 06:05:03,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-24 06:05:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 260 transitions. [2023-12-24 06:05:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-24 06:05:03,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:05:03,669 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:05:03,735 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 06:05:03,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:05:03,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:05:03,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:05:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1134275873, now seen corresponding path program 1 times [2023-12-24 06:05:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:05:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593351352] [2023-12-24 06:05:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:05:03,884 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 [2023-12-24 06:05:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:05:03,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:05:03,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 06:05:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:05:06,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 06:05:06,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:05:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-24 06:05:11,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:05:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 06:05:13,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:05:13,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593351352] [2023-12-24 06:05:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593351352] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 06:05:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 06:05:13,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-12-24 06:05:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605955278] [2023-12-24 06:05:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:05:13,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 06:05:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:05:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 06:05:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-24 06:05:13,819 INFO L87 Difference]: Start difference. First operand 183 states and 260 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 06:05:22,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 06:05:27,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 06:05:32,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 06:05:36,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 06:05:42,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 06:05:46,327 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 [1] [2023-12-24 06:05:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:05:46,827 INFO L93 Difference]: Finished difference Result 415 states and 583 transitions. [2023-12-24 06:05:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 06:05:46,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2023-12-24 06:05:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:05:46,840 INFO L225 Difference]: With dead ends: 415 [2023-12-24 06:05:46,840 INFO L226 Difference]: Without dead ends: 252 [2023-12-24 06:05:46,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-24 06:05:46,842 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 111 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2023-12-24 06:05:46,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 236 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 6 Unknown, 0 Unchecked, 32.2s Time] [2023-12-24 06:05:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-24 06:05:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2023-12-24 06:05:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 165 states have internal predecessors, (202), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-24 06:05:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 350 transitions. [2023-12-24 06:05:46,883 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 350 transitions. Word has length 162 [2023-12-24 06:05:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:05:46,884 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 350 transitions. [2023-12-24 06:05:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 06:05:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 350 transitions. [2023-12-24 06:05:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-24 06:05:46,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:05:46,887 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:05:46,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 06:05:47,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:05:47,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:05:47,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:05:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 547469859, now seen corresponding path program 1 times [2023-12-24 06:05:47,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:05:47,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146012871] [2023-12-24 06:05:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:05:47,108 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 [2023-12-24 06:05:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:05:47,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:05:47,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 06:05:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:05:49,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 06:05:49,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:05:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 470 proven. 120 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2023-12-24 06:05:56,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:05:58,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:05:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146012871] [2023-12-24 06:05:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146012871] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:05:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092296611] [2023-12-24 06:05:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:05:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 06:05:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 06:05:58,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 06:05:58,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 06:06:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:06:06,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 06:06:06,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:06:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 470 proven. 120 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2023-12-24 06:06:13,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:06:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2092296611] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:06:14,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:06:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-12-24 06:06:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495159936] [2023-12-24 06:06:14,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:06:14,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 06:06:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:06:14,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 06:06:14,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-24 06:06:14,288 INFO L87 Difference]: Start difference. First operand 248 states and 350 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 06:06:25,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:29,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:33,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:37,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:40,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:45,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:06:49,994 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 [] [2023-12-24 06:06:53,996 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 [] [2023-12-24 06:06:58,005 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 [] [2023-12-24 06:07:02,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:07:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:07:02,055 INFO L93 Difference]: Finished difference Result 516 states and 701 transitions. [2023-12-24 06:07:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 06:07:02,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 162 [2023-12-24 06:07:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:07:02,491 INFO L225 Difference]: With dead ends: 516 [2023-12-24 06:07:02,491 INFO L226 Difference]: Without dead ends: 292 [2023-12-24 06:07:02,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-12-24 06:07:02,493 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 73 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.0s IncrementalHoareTripleChecker+Time [2023-12-24 06:07:02,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 233 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 9 Unknown, 0 Unchecked, 47.0s Time] [2023-12-24 06:07:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-24 06:07:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 276. [2023-12-24 06:07:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 185 states have internal predecessors, (220), 74 states have call successors, (74), 19 states have call predecessors, (74), 19 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-24 06:07:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 368 transitions. [2023-12-24 06:07:02,520 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 368 transitions. Word has length 162 [2023-12-24 06:07:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:07:02,523 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 368 transitions. [2023-12-24 06:07:02,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 06:07:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 368 transitions. [2023-12-24 06:07:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-24 06:07:02,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:07:02,527 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:07:02,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 06:07:02,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-24 06:07:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 06:07:02,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:07:02,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:07:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1880827745, now seen corresponding path program 1 times [2023-12-24 06:07:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:07:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705581668] [2023-12-24 06:07:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:07:02,929 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 [2023-12-24 06:07:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:07:02,930 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2023-12-24 06:07:02,933 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 (9)] Waiting until timeout for monitored process [2023-12-24 06:07:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:07:04,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 06:07:04,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:08:27,192 WARN L293 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:08:34,260 WARN L293 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:08:42,742 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:08:54,720 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:09:06,714 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:09:13,045 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:09:23,161 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:09:29,951 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:09:39,753 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:10:08,491 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:10:16,646 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:10:21,924 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:10:40,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) c_~var_1_1~0)) (.cse2 ((_ zero_extend 24) c_~var_1_6~0)) (.cse1 ((_ zero_extend 24) c_~var_1_5~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= c_~var_1_32~0 c_~var_1_26~0) (= c_~last_1_var_1_31~0 (_ bv100000 32)) (let ((.cse0 (fp.lt c_~var_1_13~0 (fp.mul c_currentRoundingMode c_~var_1_32~0 c_~var_1_12~0)))) (or (and (not .cse0) (= |c_ULTIMATE.start_step_~stepLocal_3~0#1| (_ bv0 8))) (and .cse0 (= (_ bv1 8) |c_ULTIMATE.start_step_~stepLocal_3~0#1|)))) (= c_~var_1_10~0 c_~var_1_35~0) (fp.leq c_~var_1_26~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427387900.0))) (= (_ bv256 16) c_~last_1_var_1_19~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg .cse1))) c_~var_1_1~0) (= (_ bv0 8) c_~last_1_var_1_9~0) (let ((.cse3 (bvsgt .cse2 .cse4))) (or (and (= .cse2 c_~var_1_14~0) .cse3) (and (not .cse3) (= c_~var_1_14~0 .cse4)))) (= c_~var_1_22~0 (_ bv0 8)) (let ((.cse5 (bvadd .cse2 (bvneg .cse4)))) (let ((.cse6 (bvslt .cse5 (_ bv0 32)))) (or (and (= ((_ extract 15 0) (bvneg .cse5)) c_~var_1_7~0) .cse6) (and (not .cse6) (= ((_ extract 15 0) .cse5) c_~var_1_7~0))))) (bvsge ((_ zero_extend 16) c_~var_1_30~0) (_ bv32767 32)) (bvsge ((_ zero_extend 24) c_~var_1_24~0) (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 7 0) (bvadd .cse2 .cse1))) (fp.geq c_~var_1_26~0 .cse7) (= (_ bv100000 32) c_~var_1_31~0) (= (_ bv256 16) c_~var_1_19~0) (= ((_ zero_extend 8) c_~var_1_1~0) c_~var_1_34~0) (let ((.cse8 (fp.gt c_~var_1_12~0 c_~var_1_13~0))) (or (and .cse8 (= c_~var_1_11~0 c_~var_1_12~0)) (and (not .cse8) (= c_~var_1_11~0 c_~var_1_13~0)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (fp.geq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))))))))) is different from false [2023-12-24 06:10:44,923 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) c_~var_1_1~0)) (.cse2 ((_ zero_extend 24) c_~var_1_6~0)) (.cse1 ((_ zero_extend 24) c_~var_1_5~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= c_~var_1_32~0 c_~var_1_26~0) (= c_~last_1_var_1_31~0 (_ bv100000 32)) (let ((.cse0 (fp.lt c_~var_1_13~0 (fp.mul c_currentRoundingMode c_~var_1_32~0 c_~var_1_12~0)))) (or (and (not .cse0) (= |c_ULTIMATE.start_step_~stepLocal_3~0#1| (_ bv0 8))) (and .cse0 (= (_ bv1 8) |c_ULTIMATE.start_step_~stepLocal_3~0#1|)))) (= c_~var_1_10~0 c_~var_1_35~0) (fp.leq c_~var_1_26~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427387900.0))) (= (_ bv256 16) c_~last_1_var_1_19~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg .cse1))) c_~var_1_1~0) (= (_ bv0 8) c_~last_1_var_1_9~0) (let ((.cse3 (bvsgt .cse2 .cse4))) (or (and (= .cse2 c_~var_1_14~0) .cse3) (and (not .cse3) (= c_~var_1_14~0 .cse4)))) (= c_~var_1_22~0 (_ bv0 8)) (let ((.cse5 (bvadd .cse2 (bvneg .cse4)))) (let ((.cse6 (bvslt .cse5 (_ bv0 32)))) (or (and (= ((_ extract 15 0) (bvneg .cse5)) c_~var_1_7~0) .cse6) (and (not .cse6) (= ((_ extract 15 0) .cse5) c_~var_1_7~0))))) (bvsge ((_ zero_extend 16) c_~var_1_30~0) (_ bv32767 32)) (bvsge ((_ zero_extend 24) c_~var_1_24~0) (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 7 0) (bvadd .cse2 .cse1))) (fp.geq c_~var_1_26~0 .cse7) (= (_ bv100000 32) c_~var_1_31~0) (= (_ bv256 16) c_~var_1_19~0) (= ((_ zero_extend 8) c_~var_1_1~0) c_~var_1_34~0) (let ((.cse8 (fp.gt c_~var_1_12~0 c_~var_1_13~0))) (or (and .cse8 (= c_~var_1_11~0 c_~var_1_12~0)) (and (not .cse8) (= c_~var_1_11~0 c_~var_1_13~0)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (fp.geq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))))))))) is different from true [2023-12-24 06:10:51,639 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:02,869 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:11,080 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:21,721 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:29,944 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:37,377 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:58,460 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:10,259 WARN L293 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:18,490 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:25,415 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:30,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ zero_extend 24) c_~var_1_1~0)) (.cse1 ((_ zero_extend 24) c_~var_1_6~0)) (.cse0 ((_ zero_extend 24) c_~var_1_5~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_32~0 c_~var_1_26~0) (= c_~last_1_var_1_31~0 (_ bv100000 32)) (= c_~var_1_10~0 c_~var_1_35~0) (fp.leq c_~var_1_26~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427387900.0))) (= (_ bv256 16) c_~last_1_var_1_19~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg .cse0))) c_~var_1_1~0) (= (_ bv0 8) c_~last_1_var_1_9~0) (let ((.cse2 (bvsgt .cse1 .cse3))) (or (and (= .cse1 c_~var_1_14~0) .cse2) (and (not .cse2) (= c_~var_1_14~0 .cse3)))) (= c_~var_1_22~0 (_ bv0 8)) (let ((.cse4 (bvadd .cse1 (bvneg .cse3)))) (let ((.cse5 (bvslt .cse4 (_ bv0 32)))) (or (and (= ((_ extract 15 0) (bvneg .cse4)) c_~var_1_7~0) .cse5) (and (not .cse5) (= ((_ extract 15 0) .cse4) c_~var_1_7~0))))) (bvsge ((_ zero_extend 16) c_~var_1_30~0) (_ bv32767 32)) (bvsge ((_ zero_extend 24) c_~var_1_24~0) (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 7 0) (bvadd .cse1 .cse0))) (fp.geq c_~var_1_26~0 .cse6) (= (_ bv100000 32) c_~var_1_31~0) (= (_ bv256 16) c_~var_1_19~0) (or (not (fp.lt c_~var_1_13~0 (fp.mul c_currentRoundingMode c_~var_1_32~0 c_~var_1_12~0))) (= c_~var_1_16~0 (_ bv0 8))) (= ((_ zero_extend 8) c_~var_1_1~0) c_~var_1_34~0) (let ((.cse7 (fp.gt c_~var_1_12~0 c_~var_1_13~0))) (or (and .cse7 (= c_~var_1_11~0 c_~var_1_12~0)) (and (not .cse7) (= c_~var_1_11~0 c_~var_1_13~0)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_13~0 .cse6) (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode .cse8))) (and (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (fp.geq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse8))))))))) is different from false [2023-12-24 06:12:34,102 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ zero_extend 24) c_~var_1_1~0)) (.cse1 ((_ zero_extend 24) c_~var_1_6~0)) (.cse0 ((_ zero_extend 24) c_~var_1_5~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_32~0 c_~var_1_26~0) (= c_~last_1_var_1_31~0 (_ bv100000 32)) (= c_~var_1_10~0 c_~var_1_35~0) (fp.leq c_~var_1_26~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427387900.0))) (= (_ bv256 16) c_~last_1_var_1_19~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg .cse0))) c_~var_1_1~0) (= (_ bv0 8) c_~last_1_var_1_9~0) (let ((.cse2 (bvsgt .cse1 .cse3))) (or (and (= .cse1 c_~var_1_14~0) .cse2) (and (not .cse2) (= c_~var_1_14~0 .cse3)))) (= c_~var_1_22~0 (_ bv0 8)) (let ((.cse4 (bvadd .cse1 (bvneg .cse3)))) (let ((.cse5 (bvslt .cse4 (_ bv0 32)))) (or (and (= ((_ extract 15 0) (bvneg .cse4)) c_~var_1_7~0) .cse5) (and (not .cse5) (= ((_ extract 15 0) .cse4) c_~var_1_7~0))))) (bvsge ((_ zero_extend 16) c_~var_1_30~0) (_ bv32767 32)) (bvsge ((_ zero_extend 24) c_~var_1_24~0) (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 7 0) (bvadd .cse1 .cse0))) (fp.geq c_~var_1_26~0 .cse6) (= (_ bv100000 32) c_~var_1_31~0) (= (_ bv256 16) c_~var_1_19~0) (or (not (fp.lt c_~var_1_13~0 (fp.mul c_currentRoundingMode c_~var_1_32~0 c_~var_1_12~0))) (= c_~var_1_16~0 (_ bv0 8))) (= ((_ zero_extend 8) c_~var_1_1~0) c_~var_1_34~0) (let ((.cse7 (fp.gt c_~var_1_12~0 c_~var_1_13~0))) (or (and .cse7 (= c_~var_1_11~0 c_~var_1_12~0)) (and (not .cse7) (= c_~var_1_11~0 c_~var_1_13~0)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_13~0 .cse6) (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode .cse8))) (and (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (fp.geq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse8))))))))) is different from true [2023-12-24 06:12:41,752 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:48,979 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:57,190 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:07,898 WARN L293 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:18,846 WARN L293 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:24,917 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:30,913 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:36,691 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:45,628 WARN L293 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:13:53,657 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:13,106 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:19,063 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:25,051 WARN L293 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:31,893 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:39,768 WARN L293 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:47,611 WARN L293 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:14:55,242 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:15:03,448 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:15:10,044 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:15:27,527 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:15:48,799 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:15:56,959 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:16:02,560 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:16:35,747 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:17:03,318 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ zero_extend 24) c_~var_1_1~0)) (.cse1 ((_ zero_extend 24) c_~var_1_6~0)) (.cse0 ((_ zero_extend 24) c_~var_1_5~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_32~0 c_~var_1_26~0) (= c_~last_1_var_1_31~0 (_ bv100000 32)) (= c_~var_1_10~0 c_~var_1_35~0) (fp.leq c_~var_1_26~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427387900.0))) (= (_ bv256 16) c_~last_1_var_1_19~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg .cse0))) c_~var_1_1~0) (= (_ bv0 8) c_~last_1_var_1_9~0) (let ((.cse2 (bvsgt .cse1 .cse3))) (or (and (= .cse1 c_~var_1_14~0) .cse2) (and (not .cse2) (= c_~var_1_14~0 .cse3)))) (= c_~var_1_22~0 (_ bv0 8)) (let ((.cse4 (bvadd .cse1 (bvneg .cse3)))) (let ((.cse5 (bvslt .cse4 (_ bv0 32)))) (or (and (= ((_ extract 15 0) (bvneg .cse4)) c_~var_1_7~0) .cse5) (and (not .cse5) (= ((_ extract 15 0) .cse4) c_~var_1_7~0))))) (bvsge ((_ zero_extend 16) c_~var_1_30~0) (_ bv32767 32)) (bvsge ((_ zero_extend 24) c_~var_1_24~0) (_ bv1 32)) (= c_~var_1_20~0 ((_ extract 7 0) (bvadd .cse1 .cse0))) (fp.geq c_~var_1_26~0 .cse6) (= (_ bv100000 32) c_~var_1_31~0) (= (_ bv256 16) c_~var_1_19~0) (or (not (fp.lt c_~var_1_13~0 (fp.mul c_currentRoundingMode c_~var_1_32~0 c_~var_1_12~0))) (= c_~var_1_16~0 (_ bv0 8))) (= ((_ zero_extend 8) c_~var_1_1~0) c_~var_1_34~0) (= c_~var_1_10~0 c_~var_1_9~0) (let ((.cse7 (fp.gt c_~var_1_12~0 c_~var_1_13~0))) (or (and .cse7 (= c_~var_1_11~0 c_~var_1_12~0)) (and (not .cse7) (= c_~var_1_11~0 c_~var_1_13~0)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_13~0 .cse6) (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode .cse8))) (and (fp.leq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (fp.geq c_~var_1_13~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse8))))))))) is different from true [2023-12-24 06:17:10,210 WARN L293 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-24 06:17:12,804 WARN L340 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 06:17:12,804 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 06:17:13,847 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 06:17:14,008 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 06:17:14,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 06:17:14,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:17:14,081 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 163 with TraceHistMax 25,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-24 06:17:14,091 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 06:17:14,092 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:17:14,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:17:14 BoogieIcfgContainer [2023-12-24 06:17:14,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:17:14,096 INFO L158 Benchmark]: Toolchain (without parser) took 885680.37ms. Allocated memory is still 192.9MB. Free memory was 149.2MB in the beginning and 114.0MB in the end (delta: 35.3MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,096 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 192.9MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:17:14,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.04ms. Allocated memory is still 192.9MB. Free memory was 149.2MB in the beginning and 131.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.27ms. Allocated memory is still 192.9MB. Free memory was 131.4MB in the beginning and 128.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,097 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 192.9MB. Free memory was 128.6MB in the beginning and 123.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,097 INFO L158 Benchmark]: RCFGBuilder took 26698.32ms. Allocated memory is still 192.9MB. Free memory was 123.4MB in the beginning and 150.3MB in the end (delta: -26.9MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,097 INFO L158 Benchmark]: TraceAbstraction took 858569.04ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 114.0MB in the end (delta: 35.8MB). Peak memory consumption was 99.7MB. Max. memory is 8.0GB. [2023-12-24 06:17:14,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 192.9MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.04ms. Allocated memory is still 192.9MB. Free memory was 149.2MB in the beginning and 131.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.27ms. Allocated memory is still 192.9MB. Free memory was 131.4MB in the beginning and 128.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 192.9MB. Free memory was 128.6MB in the beginning and 123.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 26698.32ms. Allocated memory is still 192.9MB. Free memory was 123.4MB in the beginning and 150.3MB in the end (delta: -26.9MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. * TraceAbstraction took 858569.04ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 114.0MB in the end (delta: 35.8MB). Peak memory consumption was 99.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 163 with TraceHistMax 25,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 858.5s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 190.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 183.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 644 mSDsluCounter, 1442 SdHoareTripleChecker+Invalid, 179.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 873 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 569 mSDtfsCounter, 1173 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1576 GetRequests, 1506 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=5, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 122 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 20.2s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1446 ConstructedInterpolants, 6 QuantifiedInterpolants, 4964 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1907 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 10341/10800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown