/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_loopvsstraightlinecode_100-while_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 23:42:06,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 23:42:06,811 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 23:42:06,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 23:42:06,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 23:42:06,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 23:42:06,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 23:42:06,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 23:42:06,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 23:42:06,846 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 23:42:06,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 23:42:06,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 23:42:06,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 23:42:06,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 23:42:06,848 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 23:42:06,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 23:42:06,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 23:42:06,849 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 23:42:06,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 23:42:06,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 23:42:06,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 23:42:06,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 23:42:06,851 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 23:42:06,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 23:42:06,851 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 23:42:06,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 23:42:06,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 23:42:06,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 23:42:06,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 23:42:06,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 23:42:06,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 23:42:06,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 23:42:06,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 23:42:06,854 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 23:42:06,854 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 23:42:07,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 23:42:07,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 23:42:07,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 23:42:07,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 23:42:07,073 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 23:42:07,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2023-12-23 23:42:08,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 23:42:08,360 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 23:42:08,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2023-12-23 23:42:08,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fd7eea0/faaa3685e555427e876ec5c73166be00/FLAG77293b8e9 [2023-12-23 23:42:08,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fd7eea0/faaa3685e555427e876ec5c73166be00 [2023-12-23 23:42:08,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 23:42:08,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 23:42:08,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 23:42:08,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 23:42:08,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 23:42:08,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fd98cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08, skipping insertion in model container [2023-12-23 23:42:08,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 23:42:08,533 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_loopvsstraightlinecode_100-while_file-9.i[915,928] [2023-12-23 23:42:08,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 23:42:08,628 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 23:42:08,637 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_loopvsstraightlinecode_100-while_file-9.i[915,928] [2023-12-23 23:42:08,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 23:42:08,691 INFO L206 MainTranslator]: Completed translation [2023-12-23 23:42:08,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08 WrapperNode [2023-12-23 23:42:08,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 23:42:08,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 23:42:08,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 23:42:08,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 23:42:08,696 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:42:08" (1/1) ... [2023-12-23 23:42:08,706 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:42:08" (1/1) ... [2023-12-23 23:42:08,739 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2023-12-23 23:42:08,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 23:42:08,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 23:42:08,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 23:42:08,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 23:42:08,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,760 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 23:42:08,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 23:42:08,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 23:42:08,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 23:42:08,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 23:42:08,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (1/1) ... [2023-12-23 23:42:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 23:42:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 23:42:08,801 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 23:42:08,836 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 23:42:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 23:42:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 23:42:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 23:42:08,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 23:42:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 23:42:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 23:42:08,930 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 23:42:08,933 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 23:42:20,110 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 23:42:20,248 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 23:42:20,248 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 23:42:20,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:42:20 BoogieIcfgContainer [2023-12-23 23:42:20,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 23:42:20,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 23:42:20,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 23:42:20,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 23:42:20,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:42:08" (1/3) ... [2023-12-23 23:42:20,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1b05c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:42:20, skipping insertion in model container [2023-12-23 23:42:20,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:42:08" (2/3) ... [2023-12-23 23:42:20,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1b05c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:42:20, skipping insertion in model container [2023-12-23 23:42:20,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:42:20" (3/3) ... [2023-12-23 23:42:20,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-9.i [2023-12-23 23:42:20,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 23:42:20,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 23:42:20,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 23:42:20,369 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;@165de8d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 23:42:20,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 23:42:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-23 23:42:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-23 23:42:20,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 23:42:20,383 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:20,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 23:42:20,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 23:42:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -621673743, now seen corresponding path program 1 times [2023-12-23 23:42:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 23:42:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208849540] [2023-12-23 23:42:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 23:42:20,400 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 23:42:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 23:42:20,403 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 23:42:20,404 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 23:42:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 23:42:21,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 23:42:21,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 23:42:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2023-12-23 23:42:21,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 23:42:21,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 23:42:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208849540] [2023-12-23 23:42:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208849540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 23:42:21,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 23:42:21,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 23:42:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584551968] [2023-12-23 23:42:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 23:42:21,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 23:42:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 23:42:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 23:42:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 23:42:21,396 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 23:42:26,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:42:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 23:42:26,170 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2023-12-23 23:42:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 23:42:26,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2023-12-23 23:42:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 23:42:26,441 INFO L225 Difference]: With dead ends: 156 [2023-12-23 23:42:26,441 INFO L226 Difference]: Without dead ends: 77 [2023-12-23 23:42:26,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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 23:42:26,449 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 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-23 23:42:26,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-23 23:42:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-23 23:42:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-23 23:42:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-23 23:42:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2023-12-23 23:42:26,494 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 162 [2023-12-23 23:42:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 23:42:26,494 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2023-12-23 23:42:26,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 23:42:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2023-12-23 23:42:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-23 23:42:26,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 23:42:26,497 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:26,518 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 23:42:26,705 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 23:42:26,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 23:42:26,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 23:42:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -96655447, now seen corresponding path program 1 times [2023-12-23 23:42:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 23:42:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016022816] [2023-12-23 23:42:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 23:42:26,708 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 23:42:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 23:42:26,712 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 23:42:26,750 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 23:42:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 23:42:27,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 23:42:27,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 23:42:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-23 23:42:27,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 23:42:27,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 23:42:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016022816] [2023-12-23 23:42:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016022816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 23:42:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 23:42:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 23:42:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542264171] [2023-12-23 23:42:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 23:42:27,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 23:42:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 23:42:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 23:42:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 23:42:27,846 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:42:32,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:42:36,701 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-23 23:42:40,710 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-23 23:42:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 23:42:41,004 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2023-12-23 23:42:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 23:42:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2023-12-23 23:42:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 23:42:41,006 INFO L225 Difference]: With dead ends: 182 [2023-12-23 23:42:41,007 INFO L226 Difference]: Without dead ends: 106 [2023-12-23 23:42:41,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 23:42:41,008 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 37 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-23 23:42:41,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 230 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2023-12-23 23:42:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-23 23:42:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2023-12-23 23:42:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 73 states have internal predecessors, (98), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-23 23:42:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2023-12-23 23:42:41,027 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 162 [2023-12-23 23:42:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 23:42:41,028 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2023-12-23 23:42:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:42:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2023-12-23 23:42:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-23 23:42:41,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 23:42:41,030 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:42:41,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-23 23:42:41,237 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 23:42:41,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 23:42:41,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 23:42:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash -644454303, now seen corresponding path program 1 times [2023-12-23 23:42:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 23:42:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332671085] [2023-12-23 23:42:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 23:42:41,240 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 23:42:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 23:42:41,241 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 23:42:41,243 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 23:42:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 23:42:42,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 23:42:42,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 23:42:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-23 23:42:44,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 23:42:44,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 23:42:44,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332671085] [2023-12-23 23:42:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332671085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 23:42:44,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 23:42:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 23:42:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137063403] [2023-12-23 23:42:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 23:42:44,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 23:42:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 23:42:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 23:42:44,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-23 23:42:44,385 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:42:49,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:42:53,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:42:58,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:43:02,320 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-23 23:43:06,325 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-23 23:43:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 23:43:06,326 INFO L93 Difference]: Finished difference Result 302 states and 454 transitions. [2023-12-23 23:43:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 23:43:06,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2023-12-23 23:43:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 23:43:06,609 INFO L225 Difference]: With dead ends: 302 [2023-12-23 23:43:06,609 INFO L226 Difference]: Without dead ends: 200 [2023-12-23 23:43:06,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-23 23:43:06,611 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 80 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2023-12-23 23:43:06,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 345 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 21.9s Time] [2023-12-23 23:43:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-23 23:43:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2023-12-23 23:43:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 93 states have internal predecessors, (119), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-23 23:43:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2023-12-23 23:43:06,643 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 163 [2023-12-23 23:43:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 23:43:06,643 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2023-12-23 23:43:06,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:43:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2023-12-23 23:43:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-23 23:43:06,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 23:43:06,646 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:43:06,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-23 23:43:06,861 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 23:43:06,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 23:43:06,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 23:43:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1636244820, now seen corresponding path program 1 times [2023-12-23 23:43:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 23:43:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973321672] [2023-12-23 23:43:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 23:43:06,865 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 23:43:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 23:43:06,889 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 23:43:06,927 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 23:43:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 23:43:07,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 23:43:07,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 23:43:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-23 23:43:10,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 23:43:10,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 23:43:10,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973321672] [2023-12-23 23:43:10,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973321672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 23:43:10,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 23:43:10,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 23:43:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079032237] [2023-12-23 23:43:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 23:43:10,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 23:43:10,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 23:43:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 23:43:10,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 23:43:10,150 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:43:14,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 23:43:18,909 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-23 23:43:22,921 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-23 23:43:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 23:43:23,235 INFO L93 Difference]: Finished difference Result 354 states and 533 transitions. [2023-12-23 23:43:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 23:43:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2023-12-23 23:43:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 23:43:23,238 INFO L225 Difference]: With dead ends: 354 [2023-12-23 23:43:23,238 INFO L226 Difference]: Without dead ends: 252 [2023-12-23 23:43:23,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 23:43:23,240 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 40 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-23 23:43:23,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 227 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2023-12-23 23:43:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-23 23:43:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2023-12-23 23:43:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 164 states have internal predecessors, (211), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-23 23:43:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2023-12-23 23:43:23,270 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 164 [2023-12-23 23:43:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 23:43:23,271 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2023-12-23 23:43:23,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-12-23 23:43:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2023-12-23 23:43:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-23 23:43:23,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 23:43:23,273 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:43:23,294 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 23:43:23,485 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-23 23:43:23,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 23:43:23,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 23:43:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash -434822912, now seen corresponding path program 1 times [2023-12-23 23:43:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 23:43:23,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216746105] [2023-12-23 23:43:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 23:43:23,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 23:43:23,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 23:43:23,488 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-23 23:43:23,489 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-23 23:43:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 23:43:24,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-23 23:43:24,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 23:44:41,143 WARN L293 SmtUtils]: Spent 19.95s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 23:44:50,105 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:44:58,972 WARN L293 SmtUtils]: Spent 8.87s 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-23 23:45:07,892 WARN L293 SmtUtils]: Spent 8.92s 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-23 23:45:16,805 WARN L293 SmtUtils]: Spent 8.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-23 23:45:25,736 WARN L293 SmtUtils]: Spent 8.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-23 23:45:34,740 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:45:43,709 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:45:52,279 WARN L293 SmtUtils]: Spent 8.57s 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-23 23:46:01,201 WARN L293 SmtUtils]: Spent 8.92s 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-23 23:46:10,106 WARN L293 SmtUtils]: Spent 8.90s 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-23 23:46:19,114 WARN L293 SmtUtils]: Spent 9.01s 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-23 23:46:28,209 WARN L293 SmtUtils]: Spent 9.09s 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-23 23:46:37,164 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:46:46,111 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:46:55,055 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:47:03,985 WARN L293 SmtUtils]: Spent 8.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-23 23:47:12,905 WARN L293 SmtUtils]: Spent 8.92s 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-23 23:47:21,853 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:47:30,791 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:47:35,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 23:47:39,299 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 23:47:48,248 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:47:57,182 WARN L293 SmtUtils]: Spent 8.93s 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-23 23:48:06,182 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:48:15,144 WARN L293 SmtUtils]: Spent 8.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-23 23:48:24,105 WARN L293 SmtUtils]: Spent 8.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-23 23:48:33,087 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:48:42,084 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:48:50,659 WARN L293 SmtUtils]: Spent 8.57s 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-23 23:48:59,694 WARN L293 SmtUtils]: Spent 9.03s 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-23 23:49:08,676 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:49:17,614 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:49:26,553 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:49:35,547 WARN L293 SmtUtils]: Spent 8.99s 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-23 23:49:44,579 WARN L293 SmtUtils]: Spent 9.03s 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-23 23:49:53,556 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:50:02,518 WARN L293 SmtUtils]: Spent 8.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-23 23:50:11,460 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:50:20,406 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:50:29,405 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:50:38,407 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:50:47,365 WARN L293 SmtUtils]: Spent 8.96s 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-23 23:50:51,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= c_~var_1_33~0 c_~var_1_18~0) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (= c_~var_1_32~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 23:50:55,855 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= c_~var_1_33~0 c_~var_1_18~0) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (= c_~var_1_32~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 23:51:04,798 WARN L293 SmtUtils]: Spent 8.93s 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-23 23:51:13,745 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:51:22,681 WARN L293 SmtUtils]: Spent 8.94s 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-23 23:51:31,648 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:51:40,614 WARN L293 SmtUtils]: Spent 8.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-23 23:51:49,587 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:51:58,540 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:52:07,099 WARN L293 SmtUtils]: Spent 8.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-23 23:52:16,055 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:52:24,957 WARN L293 SmtUtils]: Spent 8.90s 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-23 23:52:33,937 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:52:42,927 WARN L293 SmtUtils]: Spent 8.99s 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-23 23:52:51,927 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:53:00,916 WARN L293 SmtUtils]: Spent 8.99s 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-23 23:53:09,883 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:53:18,886 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:53:28,081 WARN L293 SmtUtils]: Spent 9.19s 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-23 23:53:37,042 WARN L293 SmtUtils]: Spent 8.96s 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-23 23:53:46,012 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:53:54,994 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:54:03,952 WARN L293 SmtUtils]: Spent 8.96s 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-23 23:54:12,903 WARN L293 SmtUtils]: Spent 8.95s 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-23 23:54:17,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (= ((_ sign_extend 8) c_~var_1_13~0) c_~var_1_14~0) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= c_~var_1_33~0 c_~var_1_18~0) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (= c_~var_1_32~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 23:54:21,433 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ sign_extend 24) c_~var_1_23~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv63 32)) (bvsle .cse0 (_ bv63 32)) (bvsge .cse0 (_ bv0 32)) (fp.leq c_~var_1_27~0 .cse1) (= (bvadd (_ bv5 32) c_~last_1_var_1_6~0) (_ bv0 32)) (= ((_ sign_extend 8) c_~var_1_13~0) c_~var_1_14~0) (not (fp.geq (fp.neg c_~var_1_26~0) (fp.div c_currentRoundingMode c_~var_1_26~0 c_~var_1_4~0))) (fp.leq c_~var_1_28~0 .cse1) (bvsle .cse2 (_ bv63 32)) (fp.geq c_~var_1_27~0 .cse3) (or (and (fp.leq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.geq c_~var_1_29~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5)))) (and (fp.geq c_~var_1_29~0 .cse3) (fp.leq c_~var_1_29~0 .cse1))) (= c_~var_1_33~0 c_~var_1_18~0) (= (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_27~0 c_~var_1_28~0) c_~var_1_29~0) c_~var_1_26~0) (= (_ bv0 32) (bvadd (_ bv128 32) c_~var_1_1~0)) (= c_~var_1_32~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsge .cse2 (_ bv0 32)) (not (= c_~var_1_25~0 (_ bv0 8))) (fp.geq c_~var_1_28~0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 23:54:30,525 WARN L293 SmtUtils]: Spent 9.08s 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-23 23:54:39,495 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:54:48,476 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:54:57,436 WARN L293 SmtUtils]: Spent 8.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-23 23:55:06,403 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:55:15,464 WARN L293 SmtUtils]: Spent 9.06s 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-23 23:55:24,447 WARN L293 SmtUtils]: Spent 8.98s 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-23 23:55:33,120 WARN L293 SmtUtils]: Spent 8.67s 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-23 23:55:42,109 WARN L293 SmtUtils]: Spent 8.99s 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-23 23:55:51,075 WARN L293 SmtUtils]: Spent 8.97s 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-23 23:56:00,122 WARN L293 SmtUtils]: Spent 9.05s 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-23 23:56:09,079 WARN L293 SmtUtils]: Spent 8.96s 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-23 23:56:18,079 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:56:27,095 WARN L293 SmtUtils]: Spent 9.02s 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-23 23:56:36,101 WARN L293 SmtUtils]: Spent 9.00s 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-23 23:56:45,198 WARN L293 SmtUtils]: Spent 9.10s 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-23 23:56:54,225 WARN L293 SmtUtils]: Spent 9.03s 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) Received shutdown request... [2023-12-23 23:56:54,591 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 23:56:54,591 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 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 23:56:55,626 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-23 23:56:55,792 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-23 23:56:55,882 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-23 23:56:55,885 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 23:56:55,885 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 166 with TraceHistMax 26,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 23:56:55,888 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 23:56:55,890 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 23:56:55,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 11:56:55 BoogieIcfgContainer [2023-12-23 23:56:55,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 23:56:55,891 INFO L158 Benchmark]: Toolchain (without parser) took 887506.42ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 131.6MB in the beginning and 178.9MB in the end (delta: -47.3MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 23:56:55,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.78ms. Allocated memory is still 179.3MB. Free memory was 131.4MB in the beginning and 114.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.89ms. Allocated memory is still 179.3MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,912 INFO L158 Benchmark]: Boogie Preprocessor took 36.52ms. Allocated memory is still 179.3MB. Free memory was 112.1MB in the beginning and 108.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,912 INFO L158 Benchmark]: RCFGBuilder took 11470.99ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 108.0MB in the beginning and 207.7MB in the end (delta: -99.7MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,913 INFO L158 Benchmark]: TraceAbstraction took 875641.12ms. Allocated memory is still 247.5MB. Free memory was 206.7MB in the beginning and 178.9MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-23 23:56:55,916 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.13ms. Allocated memory is still 179.3MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.78ms. Allocated memory is still 179.3MB. Free memory was 131.4MB in the beginning and 114.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.89ms. Allocated memory is still 179.3MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.52ms. Allocated memory is still 179.3MB. Free memory was 112.1MB in the beginning and 108.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 11470.99ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 108.0MB in the beginning and 207.7MB in the end (delta: -99.7MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * TraceAbstraction took 875641.12ms. Allocated memory is still 247.5MB. Free memory was 206.7MB in the beginning and 178.9MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. 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 166 with TraceHistMax 26,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.6s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 53.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 52.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 919 SdHoareTripleChecker+Invalid, 51.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 488 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=4, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 651 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1088 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5200/5200 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