/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_fillercode_fillercodestructure_filler-pr-ci_file-91.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 11:28:51,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 11:28:51,841 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-23 11:28:51,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 11:28:51,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 11:28:51,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 11:28:51,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 11:28:51,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 11:28:51,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 11:28:51,874 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 11:28:51,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 11:28:51,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 11:28:51,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 11:28:51,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 11:28:51,876 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 11:28:51,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 11:28:51,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 11:28:51,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 11:28:51,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 11:28:51,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 11:28:51,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 11:28:51,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 11:28:51,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 11:28:51,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 11:28:51,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 11:28:51,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 11:28:51,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 11:28:51,884 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 11:28:51,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 11:28:51,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 11:28:51,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:28:51,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 11:28:51,886 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 11:28:51,887 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 11:28:51,887 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-23 11:28:52,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 11:28:52,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 11:28:52,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 11:28:52,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 11:28:52,084 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 11:28:52,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-91.i [2023-12-23 11:28:53,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 11:28:53,280 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 11:28:53,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-91.i [2023-12-23 11:28:53,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c52c7c31/668640b3b4034954bfe325bb7392b934/FLAGe8b53a3a6 [2023-12-23 11:28:53,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c52c7c31/668640b3b4034954bfe325bb7392b934 [2023-12-23 11:28:53,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 11:28:53,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 11:28:53,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 11:28:53,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 11:28:53,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 11:28:53,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:53,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef0e1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53, skipping insertion in model container [2023-12-23 11:28:53,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:53,730 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 11:28:53,830 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_fillercode_fillercodestructure_filler-pr-ci_file-91.i[919,932] [2023-12-23 11:28:53,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:28:53,893 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 11:28:53,912 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_fillercode_fillercodestructure_filler-pr-ci_file-91.i[919,932] [2023-12-23 11:28:53,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:28:53,952 INFO L206 MainTranslator]: Completed translation [2023-12-23 11:28:53,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53 WrapperNode [2023-12-23 11:28:53,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 11:28:53,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 11:28:53,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 11:28:53,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 11:28:53,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:53,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,027 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2023-12-23 11:28:54,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 11:28:54,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 11:28:54,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 11:28:54,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 11:28:54,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,057 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-23 11:28:54,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 11:28:54,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 11:28:54,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 11:28:54,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 11:28:54,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (1/1) ... [2023-12-23 11:28:54,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:28:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 11:28:54,142 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-23 11:28:54,156 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-23 11:28:54,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 11:28:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 11:28:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 11:28:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 11:28:54,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 11:28:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 11:28:54,271 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 11:28:54,277 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 11:29:03,274 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 11:29:03,329 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 11:29:03,330 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 11:29:03,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:29:03 BoogieIcfgContainer [2023-12-23 11:29:03,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 11:29:03,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 11:29:03,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 11:29:03,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 11:29:03,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:28:53" (1/3) ... [2023-12-23 11:29:03,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6f8d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:29:03, skipping insertion in model container [2023-12-23 11:29:03,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:28:53" (2/3) ... [2023-12-23 11:29:03,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6f8d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:29:03, skipping insertion in model container [2023-12-23 11:29:03,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:29:03" (3/3) ... [2023-12-23 11:29:03,338 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-91.i [2023-12-23 11:29:03,351 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 11:29:03,351 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 11:29:03,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 11:29:03,405 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;@32ffa377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 11:29:03,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 11:29:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-23 11:29:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-12-23 11:29:03,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:29:03,430 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:29:03,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:29:03,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:29:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 217598109, now seen corresponding path program 1 times [2023-12-23 11:29:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:29:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463775746] [2023-12-23 11:29:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:29:03,450 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-23 11:29:03,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:29:03,459 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-23 11:29:03,512 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-23 11:29:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:29:03,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 11:29:03,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:29:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-23 11:29:03,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:29:03,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:29:03,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463775746] [2023-12-23 11:29:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463775746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:29:03,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:29:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 11:29:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774329021] [2023-12-23 11:29:03,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:29:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 11:29:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:29:04,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 11:29:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 11:29:04,011 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-23 11:29:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:29:04,251 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2023-12-23 11:29:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 11:29:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2023-12-23 11:29:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:29:04,271 INFO L225 Difference]: With dead ends: 173 [2023-12-23 11:29:04,271 INFO L226 Difference]: Without dead ends: 86 [2023-12-23 11:29:04,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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-23 11:29:04,276 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-23 11:29:04,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-23 11:29:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-23 11:29:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-23 11:29:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-23 11:29:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2023-12-23 11:29:04,324 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2023-12-23 11:29:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:29:04,325 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2023-12-23 11:29:04,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-23 11:29:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2023-12-23 11:29:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-23 11:29:04,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:29:04,328 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:29:04,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-23 11:29:04,540 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-23 11:29:04,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:29:04,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:29:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash 920944474, now seen corresponding path program 1 times [2023-12-23 11:29:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:29:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379410312] [2023-12-23 11:29:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:29:04,543 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-23 11:29:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:29:04,545 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-23 11:29:04,546 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-23 11:29:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:29:04,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 11:29:04,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:29:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 981 proven. 36 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2023-12-23 11:29:05,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:29:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 36 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-23 11:29:06,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:29:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379410312] [2023-12-23 11:29:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379410312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 11:29:06,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 11:29:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-23 11:29:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774333412] [2023-12-23 11:29:06,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 11:29:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 11:29:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:29:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 11:29:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-23 11:29:06,181 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-23 11:29:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:29:07,306 INFO L93 Difference]: Finished difference Result 179 states and 274 transitions. [2023-12-23 11:29:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 11:29:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 204 [2023-12-23 11:29:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:29:07,319 INFO L225 Difference]: With dead ends: 179 [2023-12-23 11:29:07,320 INFO L226 Difference]: Without dead ends: 94 [2023-12-23 11:29:07,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-23 11:29:07,321 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 117 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-23 11:29:07,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 215 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-23 11:29:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-23 11:29:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-23 11:29:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-23 11:29:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2023-12-23 11:29:07,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 204 [2023-12-23 11:29:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:29:07,333 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2023-12-23 11:29:07,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-23 11:29:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2023-12-23 11:29:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-23 11:29:07,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:29:07,335 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:29:07,348 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-23 11:29:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:29:07,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:29:07,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:29:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash -90172776, now seen corresponding path program 1 times [2023-12-23 11:29:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:29:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995772156] [2023-12-23 11:29:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:29:07,550 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-23 11:29:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:29:07,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:29:07,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 11:29:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:29:07,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 11:29:07,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:29:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 981 proven. 36 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2023-12-23 11:29:08,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:29:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 36 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-23 11:29:09,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:29:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995772156] [2023-12-23 11:29:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995772156] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 11:29:09,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 11:29:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 11:29:09,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700315877] [2023-12-23 11:29:09,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 11:29:09,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 11:29:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:29:09,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 11:29:09,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 11:29:09,241 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-23 11:29:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:29:11,864 INFO L93 Difference]: Finished difference Result 260 states and 390 transitions. [2023-12-23 11:29:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 11:29:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 204 [2023-12-23 11:29:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:29:11,868 INFO L225 Difference]: With dead ends: 260 [2023-12-23 11:29:11,868 INFO L226 Difference]: Without dead ends: 171 [2023-12-23 11:29:11,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-23 11:29:11,869 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 208 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-23 11:29:11,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 412 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-23 11:29:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-23 11:29:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2023-12-23 11:29:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 90 states have internal predecessors, (110), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-23 11:29:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2023-12-23 11:29:11,885 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 204 [2023-12-23 11:29:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:29:11,885 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2023-12-23 11:29:11,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2023-12-23 11:29:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2023-12-23 11:29:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-23 11:29:11,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:29:11,887 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:29:11,912 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 (4)] Forceful destruction successful, exit code 0 [2023-12-23 11:29:12,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:29:12,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:29:12,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:29:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1140585045, now seen corresponding path program 1 times [2023-12-23 11:29:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:29:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189154777] [2023-12-23 11:29:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:29:12,114 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-23 11:29:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:29:12,117 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-23 11:29:12,120 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-23 11:29:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:29:12,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-23 11:29:12,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:29:44,983 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:29:53,289 WARN L293 SmtUtils]: Spent 8.14s 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-23 11:29:57,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.sub c_currentRoundingMode c_~var_1_19~0 c_~var_1_20~0))) (and (= c_~var_1_16~0 c_~var_1_15~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_18~0 .cse0) (fp.geq c_~var_1_18~0 .cse1)) (and (fp.geq c_~var_1_18~0 (fp.neg .cse0)) (fp.leq c_~var_1_18~0 (fp.neg .cse1))))) (= (bvadd (_ bv64 16) c_~var_1_1~0) (_ bv0 16)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse3 (fp.lt c_~var_1_20~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)))) (not .cse3)) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_20~0))))) .cse3))) (bvsle ((_ zero_extend 24) c_~var_1_25~0) (_ bv0 32)) (let ((.cse5 (fp.gt c_~var_1_18~0 .cse4))) (or (and (= .cse4 c_~var_1_17~0) (not .cse5)) (and .cse5 (= c_~var_1_18~0 c_~var_1_17~0)))) (= c_~var_1_25~0 c_~var_1_24~0) (= c_~var_1_26~0 c_~var_1_11~0) (= (_ bv0 16) (bvadd (_ bv64 16) c_~last_1_var_1_1~0)) (= c_~last_1_var_1_13~0 (_ bv64 16)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 11:30:07,151 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:30:15,496 WARN L293 SmtUtils]: Spent 8.15s 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-23 11:30:19,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.sub c_currentRoundingMode c_~var_1_19~0 c_~var_1_20~0))) (and (= c_~var_1_16~0 c_~var_1_15~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_18~0 .cse0) (fp.geq c_~var_1_18~0 .cse1)) (and (fp.geq c_~var_1_18~0 (fp.neg .cse0)) (fp.leq c_~var_1_18~0 (fp.neg .cse1))))) (= (bvadd (_ bv64 16) c_~var_1_1~0) (_ bv0 16)) (= ((_ extract 15 0) (bvadd (_ bv4294967294 32) ((_ zero_extend 24) c_~var_1_15~0))) c_~var_1_21~0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse3 (fp.lt c_~var_1_20~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)))) (not .cse3)) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_20~0))))) .cse3))) (bvsle ((_ zero_extend 24) c_~var_1_25~0) (_ bv0 32)) (let ((.cse5 (fp.gt c_~var_1_18~0 .cse4))) (or (and (= .cse4 c_~var_1_17~0) (not .cse5)) (and .cse5 (= c_~var_1_18~0 c_~var_1_17~0)))) (= c_~var_1_25~0 c_~var_1_24~0) (= c_~var_1_26~0 c_~var_1_11~0) (= (_ bv0 16) (bvadd (_ bv64 16) c_~last_1_var_1_1~0)) (= c_~last_1_var_1_13~0 (_ bv64 16)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 11:30:28,100 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:30:35,766 WARN L293 SmtUtils]: Spent 7.55s 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-23 11:30:45,397 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:30:53,826 WARN L293 SmtUtils]: Spent 8.17s 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-23 11:31:03,635 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:31:11,955 WARN L293 SmtUtils]: Spent 8.16s 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-23 11:31:16,385 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.sub c_currentRoundingMode c_~var_1_19~0 c_~var_1_20~0))) (and (= c_~var_1_16~0 c_~var_1_15~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_18~0 .cse0) (fp.geq c_~var_1_18~0 .cse1)) (and (fp.geq c_~var_1_18~0 (fp.neg .cse0)) (fp.leq c_~var_1_18~0 (fp.neg .cse1))))) (= (bvadd (_ bv64 16) c_~var_1_1~0) (_ bv0 16)) (= ((_ extract 15 0) (bvadd (_ bv4294967294 32) ((_ zero_extend 24) c_~var_1_15~0))) c_~var_1_21~0) (= c_~var_1_9~0 c_~var_1_11~0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse3 (fp.lt c_~var_1_20~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)))) (not .cse3)) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_20~0))))) .cse3))) (bvsle ((_ zero_extend 24) c_~var_1_25~0) (_ bv0 32)) (let ((.cse5 (fp.gt c_~var_1_18~0 .cse4))) (or (and (= .cse4 c_~var_1_17~0) (not .cse5)) (and .cse5 (= c_~var_1_18~0 c_~var_1_17~0)))) (= c_~var_1_25~0 c_~var_1_24~0) (= c_~var_1_26~0 c_~var_1_11~0) (= (_ bv0 16) (bvadd (_ bv64 16) c_~last_1_var_1_1~0)) (= c_~last_1_var_1_13~0 (_ bv64 16)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 11:31:25,865 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:31:34,204 WARN L293 SmtUtils]: Spent 8.15s 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-23 11:31:43,776 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:31:52,106 WARN L293 SmtUtils]: Spent 8.15s 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-23 11:31:56,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.sub c_currentRoundingMode c_~var_1_19~0 c_~var_1_20~0))) (and (= c_~var_1_16~0 c_~var_1_15~0) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_18~0 .cse0) (fp.geq c_~var_1_18~0 .cse1)) (and (fp.geq c_~var_1_18~0 (fp.neg .cse0)) (fp.leq c_~var_1_18~0 (fp.neg .cse1))))) (= c_~var_1_13~0 ((_ sign_extend 8) c_~var_1_26~0)) (= (bvadd (_ bv64 16) c_~var_1_1~0) (_ bv0 16)) (= ((_ extract 15 0) (bvadd (_ bv4294967294 32) ((_ zero_extend 24) c_~var_1_15~0))) c_~var_1_21~0) (= c_~var_1_9~0 c_~var_1_11~0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse3 (fp.lt c_~var_1_20~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)))) (not .cse3)) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53))) (fp.geq .cse2 (fp.mul c_currentRoundingMode (fp.neg ~var_1_51~0) ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~var_1_20~0))))) .cse3))) (bvsle ((_ zero_extend 24) c_~var_1_25~0) (_ bv0 32)) (let ((.cse5 (fp.gt c_~var_1_18~0 .cse4))) (or (and (= .cse4 c_~var_1_17~0) (not .cse5)) (and .cse5 (= c_~var_1_18~0 c_~var_1_17~0)))) (= c_~var_1_25~0 c_~var_1_24~0) (= c_~var_1_26~0 c_~var_1_11~0) (= (_ bv0 16) (bvadd (_ bv64 16) c_~last_1_var_1_1~0)) (= c_~last_1_var_1_13~0 (_ bv64 16)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false Received shutdown request... [2023-12-23 11:42:57,302 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-23 11:42:57,302 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 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 11:42:58,346 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-23 11:42:58,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2023-12-23 11:42:59,827 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 11:42:59,828 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 206 with TraceHistMax 32,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-18-2-2-2-2-2-2-2-3-2-2-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 context. [2023-12-23 11:42:59,838 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-23 11:42:59,856 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 11:42:59,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 11:42:59 BoogieIcfgContainer [2023-12-23 11:42:59,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 11:42:59,859 INFO L158 Benchmark]: Toolchain (without parser) took 846179.05ms. Allocated memory was 224.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 158.6MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 7.5GB. Max. memory is 8.0GB. [2023-12-23 11:42:59,859 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 224.4MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 11:42:59,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.41ms. Allocated memory is still 224.4MB. Free memory was 158.4MB in the beginning and 142.0MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-23 11:42:59,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.54ms. Allocated memory was 224.4MB in the beginning and 276.8MB in the end (delta: 52.4MB). Free memory was 141.9MB in the beginning and 240.1MB in the end (delta: -98.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2023-12-23 11:42:59,860 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 276.8MB. Free memory was 240.1MB in the beginning and 235.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 11:42:59,860 INFO L158 Benchmark]: RCFGBuilder took 9256.17ms. Allocated memory is still 276.8MB. Free memory was 235.9MB in the beginning and 207.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-23 11:42:59,860 INFO L158 Benchmark]: TraceAbstraction took 836525.65ms. Allocated memory was 276.8MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 207.0MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 7.5GB. Max. memory is 8.0GB. [2023-12-23 11:42:59,861 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.14ms. Allocated memory is still 224.4MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.41ms. Allocated memory is still 224.4MB. Free memory was 158.4MB in the beginning and 142.0MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.54ms. Allocated memory was 224.4MB in the beginning and 276.8MB in the end (delta: 52.4MB). Free memory was 141.9MB in the beginning and 240.1MB in the end (delta: -98.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 276.8MB. Free memory was 240.1MB in the beginning and 235.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 9256.17ms. Allocated memory is still 276.8MB. Free memory was 235.9MB in the beginning and 207.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 836525.65ms. Allocated memory was 276.8MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 207.0MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 7.5GB. 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 206 with TraceHistMax 32,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-18-2-2-2-2-2-2-2-3-2-2-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 836.5s, OverallIterations: 4, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 758 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 384 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 1002 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 1792 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 9776/9920 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