/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 11:01:56,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 11:01:56,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 11:01:56,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 11:01:56,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 11:01:56,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 11:01:56,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 11:01:56,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 11:01:56,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 11:01:56,512 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 11:01:56,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 11:01:56,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 11:01:56,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 11:01:56,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 11:01:56,515 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 11:01:56,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 11:01:56,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 11:01:56,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 11:01:56,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 11:01:56,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 11:01:56,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 11:01:56,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 11:01:56,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 11:01:56,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 11:01:56,518 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 11:01:56,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:01:56,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 11:01:56,519 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 11:01:56,520 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 11:01:56,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 11:01:56,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 11:01:56,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 11:01:56,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 11:01:56,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 11:01:56,521 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 11:01:56,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-23 11:01:56,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 11:01:56,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 11:01:56,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 11:01:56,783 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 11:01:56,783 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 11:01:56,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i [2023-12-23 11:01:57,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 11:01:58,124 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 11:01:58,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i [2023-12-23 11:01:58,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aa7470b4/69f7b4d4d6d84fd2b3af6d556c4450f0/FLAGb86f43e77 [2023-12-23 11:01:58,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aa7470b4/69f7b4d4d6d84fd2b3af6d556c4450f0 [2023-12-23 11:01:58,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 11:01:58,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 11:01:58,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 11:01:58,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 11:01:58,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 11:01:58,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f38b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58, skipping insertion in model container [2023-12-23 11:01:58,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,181 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 11:01:58,275 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i[919,932] [2023-12-23 11:01:58,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:01:58,350 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 11:01:58,366 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i[919,932] [2023-12-23 11:01:58,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:01:58,410 INFO L206 MainTranslator]: Completed translation [2023-12-23 11:01:58,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58 WrapperNode [2023-12-23 11:01:58,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 11:01:58,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 11:01:58,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 11:01:58,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 11:01:58,416 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:01:58" (1/1) ... [2023-12-23 11:01:58,426 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:01:58" (1/1) ... [2023-12-23 11:01:58,446 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2023-12-23 11:01:58,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 11:01:58,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 11:01:58,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 11:01:58,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 11:01:58,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,471 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-23 11:01:58,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 11:01:58,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 11:01:58,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 11:01:58,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 11:01:58,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (1/1) ... [2023-12-23 11:01:58,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:01:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 11:01:58,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-23 11:01:58,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-23 11:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 11:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 11:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 11:01:58,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 11:01:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 11:01:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 11:01:58,696 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 11:01:58,700 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 11:02:12,703 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 11:02:12,767 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 11:02:12,768 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 11:02:12,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:02:12 BoogieIcfgContainer [2023-12-23 11:02:12,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 11:02:12,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 11:02:12,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 11:02:12,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 11:02:12,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:01:58" (1/3) ... [2023-12-23 11:02:12,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e69554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:02:12, skipping insertion in model container [2023-12-23 11:02:12,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:01:58" (2/3) ... [2023-12-23 11:02:12,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e69554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:02:12, skipping insertion in model container [2023-12-23 11:02:12,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:02:12" (3/3) ... [2023-12-23 11:02:12,783 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-55.i [2023-12-23 11:02:12,798 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 11:02:12,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 11:02:12,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 11:02:12,870 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;@7a4ade99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 11:02:12,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 11:02:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:02:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:02:12,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:02:12,895 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:02:12,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:02:12,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:02:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -110789656, now seen corresponding path program 1 times [2023-12-23 11:02:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:02:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085501386] [2023-12-23 11:02:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:02:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:02:12,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:02:12,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-23 11:02:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:02:14,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 11:02:14,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:02:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-12-23 11:02:14,292 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:02:14,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:02:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085501386] [2023-12-23 11:02:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085501386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:02:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:02:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 11:02:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534492655] [2023-12-23 11:02:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:02:14,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 11:02:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:02:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 11:02:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 11:02:14,342 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-23 11:02:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:02:14,495 INFO L93 Difference]: Finished difference Result 159 states and 295 transitions. [2023-12-23 11:02:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 11:02:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2023-12-23 11:02:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:02:14,512 INFO L225 Difference]: With dead ends: 159 [2023-12-23 11:02:14,513 INFO L226 Difference]: Without dead ends: 78 [2023-12-23 11:02:14,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 11:02:14,519 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-23 11:02:14,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-23 11:02:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-23 11:02:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-23 11:02:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:02:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2023-12-23 11:02:14,562 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 200 [2023-12-23 11:02:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:02:14,562 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2023-12-23 11:02:14,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-23 11:02:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2023-12-23 11:02:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:02:14,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:02:14,567 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:02:14,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-23 11:02:14,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:14,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:02:14,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:02:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1747399394, now seen corresponding path program 1 times [2023-12-23 11:02:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:02:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874321122] [2023-12-23 11:02:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:02:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:02:14,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:02:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-23 11:02:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:02:15,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 11:02:15,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:02:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 708 proven. 18 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2023-12-23 11:02:16,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:02:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-12-23 11:02:16,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:02:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874321122] [2023-12-23 11:02:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874321122] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 11:02:16,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 11:02:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 11:02:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813693962] [2023-12-23 11:02:16,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 11:02:16,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 11:02:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:02:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 11:02:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 11:02:16,933 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-12-23 11:02:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:02:18,264 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2023-12-23 11:02:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 11:02:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 200 [2023-12-23 11:02:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:02:18,272 INFO L225 Difference]: With dead ends: 161 [2023-12-23 11:02:18,272 INFO L226 Difference]: Without dead ends: 84 [2023-12-23 11:02:18,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2023-12-23 11:02:18,274 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 108 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-23 11:02:18,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 169 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-23 11:02:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-23 11:02:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-12-23 11:02:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:02:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2023-12-23 11:02:18,285 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 200 [2023-12-23 11:02:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:02:18,286 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2023-12-23 11:02:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-12-23 11:02:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2023-12-23 11:02:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:02:18,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:02:18,288 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:02:18,304 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 11:02:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:18,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:02:18,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:02:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1354372384, now seen corresponding path program 1 times [2023-12-23 11:02:18,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:02:18,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770017133] [2023-12-23 11:02:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:02:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:18,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:02:18,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:02:18,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 11:02:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:02:19,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 11:02:19,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:02:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 708 proven. 18 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2023-12-23 11:02:20,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:02:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-12-23 11:02:20,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:02:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770017133] [2023-12-23 11:02:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770017133] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 11:02:20,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 11:02:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 11:02:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634167171] [2023-12-23 11:02:20,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 11:02:20,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 11:02:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:02:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 11:02:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 11:02:20,452 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-12-23 11:02:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:02:22,782 INFO L93 Difference]: Finished difference Result 235 states and 354 transitions. [2023-12-23 11:02:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 11:02:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 200 [2023-12-23 11:02:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:02:22,785 INFO L225 Difference]: With dead ends: 235 [2023-12-23 11:02:22,785 INFO L226 Difference]: Without dead ends: 154 [2023-12-23 11:02:22,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-12-23 11:02:22,786 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 204 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-23 11:02:22,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 341 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-23 11:02:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-23 11:02:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 82. [2023-12-23 11:02:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:02:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2023-12-23 11:02:22,800 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 200 [2023-12-23 11:02:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:02:22,800 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2023-12-23 11:02:22,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-12-23 11:02:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2023-12-23 11:02:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:02:22,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:02:22,802 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:02:22,820 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 11:02:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:23,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:02:23,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:02:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1411690268, now seen corresponding path program 1 times [2023-12-23 11:02:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:02:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76125145] [2023-12-23 11:02:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:02:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:02:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:02:23,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:02:23,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 11:02:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:02:24,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 11:02:24,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:03:06,485 WARN L293 SmtUtils]: Spent 6.90s 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 11:03:19,253 WARN L293 SmtUtils]: Spent 5.30s 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 11:03:36,706 WARN L293 SmtUtils]: Spent 7.20s 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 11:03:49,209 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:03:55,361 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:04:02,097 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse6))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse6))) (and (not (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0))))) (let ((.cse0 (fp.neg c_~var_1_8~0))) (or (fp.lt c_~var_1_1~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (and (fp.lt c_~var_1_1~0 .cse1) (fp.gt .cse1 .cse0))))) (= c_~var_1_7~0 c_~var_1_1~0) (or (and (fp.leq c_~var_1_7~0 .cse2) (fp.geq c_~var_1_7~0 .cse3)) (fp.geq c_~var_1_7~0 .cse4)) (or (and (fp.geq c_~var_1_8~0 .cse3) (fp.leq c_~var_1_8~0 .cse2)) (and (fp.geq c_~var_1_8~0 .cse4) (fp.leq c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode .cse5)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 11:04:14,245 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:04:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 191 proven. 180 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2023-12-23 11:04:14,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:04:32,660 WARN L293 SmtUtils]: Spent 8.51s 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 11:04:44,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from false [2023-12-23 11:04:54,882 WARN L293 SmtUtils]: Spent 7.29s 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 11:05:03,453 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 11:05:09,450 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:05:18,020 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 11:05:27,328 WARN L293 SmtUtils]: Spent 6.41s 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 11:05:33,949 WARN L293 SmtUtils]: Spent 6.62s 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 11:05:41,064 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:05:46,704 WARN L293 SmtUtils]: Spent 5.64s 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 11:05:50,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0)))) (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from false [2023-12-23 11:05:55,021 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0)))) (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from true [2023-12-23 11:06:05,341 WARN L293 SmtUtils]: Spent 6.19s 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 11:06:15,572 WARN L293 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:06:25,080 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:06:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:06:29,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:06:29,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76125145] [2023-12-23 11:06:29,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76125145] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 11:06:29,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 11:06:29,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-12-23 11:06:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383780606] [2023-12-23 11:06:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:06:29,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-23 11:06:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:06:29,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-23 11:06:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:06:29,636 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:06:33,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:06:34,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:06:36,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:06:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:06:37,179 INFO L93 Difference]: Finished difference Result 200 states and 288 transitions. [2023-12-23 11:06:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 11:06:37,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2023-12-23 11:06:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:06:37,184 INFO L225 Difference]: With dead ends: 200 [2023-12-23 11:06:37,184 INFO L226 Difference]: Without dead ends: 119 [2023-12-23 11:06:37,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:06:37,185 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 34 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-23 11:06:37,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 422 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 244 Unchecked, 7.5s Time] [2023-12-23 11:06:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-23 11:06:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2023-12-23 11:06:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-23 11:06:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2023-12-23 11:06:37,196 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 200 [2023-12-23 11:06:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:06:37,197 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2023-12-23 11:06:37,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:06:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2023-12-23 11:06:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:06:37,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:06:37,199 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:06:37,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-23 11:06:37,399 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 11:06:37,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:06:37,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:06:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1108269666, now seen corresponding path program 1 times [2023-12-23 11:06:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:06:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194183962] [2023-12-23 11:06:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:06:37,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 11:06:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:06:37,412 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 11:06:37,424 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 11:06:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:06:38,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 11:06:38,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:07:32,952 WARN L293 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:07:43,660 WARN L293 SmtUtils]: Spent 6.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 11:07:54,802 WARN L293 SmtUtils]: Spent 6.85s 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 11:08:07,998 WARN L293 SmtUtils]: Spent 8.49s 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 11:08:20,658 WARN L293 SmtUtils]: Spent 8.31s 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 11:08:28,534 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (not (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0))))) (or (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0))))) (fp.lt c_~var_1_1~0 (fp.neg c_~var_1_8~0))) (= c_~var_1_7~0 c_~var_1_1~0) (or (and (fp.leq c_~var_1_7~0 .cse0) (fp.geq c_~var_1_7~0 .cse1)) (fp.geq c_~var_1_7~0 .cse2)) (or (and (fp.geq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_8~0 .cse0)) (and (fp.geq c_~var_1_8~0 .cse2) (fp.leq c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 11:08:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 191 proven. 180 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2023-12-23 11:08:39,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:08:48,272 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:08:56,934 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:09:04,540 WARN L293 SmtUtils]: Spent 7.03s 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 11:09:10,598 WARN L293 SmtUtils]: Spent 6.06s 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 11:09:18,956 WARN L293 SmtUtils]: Spent 8.36s 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 11:09:23,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0)))) (.cse2 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0))))) (.cse0 (fp.neg c_~var_1_8~0))) (or (fp.geq .cse0 .cse1) (not (fp.lt c_~var_1_1~0 .cse2)) (fp.leq c_~var_1_8~0 c_~var_1_7~0) (fp.geq (fp.neg c_~var_1_1~0) .cse1) (not (fp.gt .cse2 .cse0)))) is different from false [2023-12-23 11:09:27,860 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0)))) (.cse2 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0))))) (.cse0 (fp.neg c_~var_1_8~0))) (or (fp.geq .cse0 .cse1) (not (fp.lt c_~var_1_1~0 .cse2)) (fp.leq c_~var_1_8~0 c_~var_1_7~0) (fp.geq (fp.neg c_~var_1_1~0) .cse1) (not (fp.gt .cse2 .cse0)))) is different from true [2023-12-23 11:09:36,437 WARN L293 SmtUtils]: Spent 8.58s 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 11:09:49,072 WARN L293 SmtUtils]: Spent 8.59s 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 11:10:02,421 WARN L293 SmtUtils]: Spent 8.58s 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 11:10:10,095 WARN L293 SmtUtils]: Spent 7.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 11:10:17,273 WARN L293 SmtUtils]: Spent 7.18s 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 11:10:23,571 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:10:31,988 WARN L293 SmtUtils]: Spent 8.42s 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 11:10:40,580 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:10:49,177 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:10:53,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0)))) (.cse2 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0))))) (.cse0 (fp.neg c_~var_1_8~0))) (or (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0)))) (fp.geq .cse0 .cse1) (not (fp.lt c_~var_1_1~0 .cse2)) (fp.leq c_~var_1_8~0 c_~var_1_7~0) (fp.geq (fp.neg c_~var_1_1~0) .cse1) (not (fp.gt .cse2 .cse0)))) is different from false [2023-12-23 11:11:04,151 WARN L293 SmtUtils]: Spent 6.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 11:11:12,722 WARN L293 SmtUtils]: Spent 8.57s 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 11:11:21,168 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:11:29,753 WARN L293 SmtUtils]: Spent 8.58s 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 11:11:42,956 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:11:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:11:45,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:11:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194183962] [2023-12-23 11:11:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194183962] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 11:11:45,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 11:11:45,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-12-23 11:11:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744129396] [2023-12-23 11:11:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:11:45,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-23 11:11:45,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:11:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-23 11:11:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:11:45,515 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:11:50,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:11:54,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:11:58,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:11:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:11:59,020 INFO L93 Difference]: Finished difference Result 235 states and 330 transitions. [2023-12-23 11:11:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 11:11:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2023-12-23 11:11:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:11:59,024 INFO L225 Difference]: With dead ends: 235 [2023-12-23 11:11:59,024 INFO L226 Difference]: Without dead ends: 134 [2023-12-23 11:11:59,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:11:59,025 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-23 11:11:59,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 328 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 2 Unknown, 242 Unchecked, 13.5s Time] [2023-12-23 11:11:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-23 11:11:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 91. [2023-12-23 11:11:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:11:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2023-12-23 11:11:59,033 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 200 [2023-12-23 11:11:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:11:59,034 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2023-12-23 11:11:59,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:11:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2023-12-23 11:11:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:11:59,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:11:59,035 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:11:59,082 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 11:11:59,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:11:59,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:11:59,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:11:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1669855706, now seen corresponding path program 1 times [2023-12-23 11:11:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:11:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179557359] [2023-12-23 11:11:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:11:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:11:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:11:59,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:11:59,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-23 11:12:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:12:00,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 11:12:00,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:12:59,161 WARN L293 SmtUtils]: Spent 7.24s 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 11:13:10,164 WARN L293 SmtUtils]: Spent 7.31s 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 11:13:15,665 WARN L293 SmtUtils]: Spent 5.50s 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 11:13:33,454 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (not (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0))))) (or (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0))))) (fp.lt c_~var_1_1~0 (fp.neg c_~var_1_8~0))) (= c_~var_1_7~0 c_~var_1_1~0) (or (and (fp.leq c_~var_1_7~0 .cse0) (fp.geq c_~var_1_7~0 .cse1)) (fp.geq c_~var_1_7~0 .cse2)) (or (and (fp.geq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_8~0 .cse0)) (and (fp.geq c_~var_1_8~0 .cse2) (fp.leq c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 11:13:42,165 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:13:49,824 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:13:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 191 proven. 180 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2023-12-23 11:13:49,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:14:05,362 WARN L293 SmtUtils]: Spent 5.65s 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 11:14:12,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from false [2023-12-23 11:14:16,825 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from true [2023-12-23 11:14:30,945 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:14:55,240 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:15:02,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 8.0))))) (or (fp.geq c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0)))) (not (fp.leq c_~var_1_8~0 c_~var_1_7~0)) (fp.geq (fp.neg c_~var_1_8~0) .cse0) (not (fp.lt c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 607.0 40.0)))))) (fp.geq (fp.neg c_~var_1_1~0) .cse0))) is different from false [2023-12-23 11:15:22,275 WARN L293 SmtUtils]: Spent 8.31s 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 11:15:29,028 WARN L293 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:15:37,386 WARN L293 SmtUtils]: Spent 8.36s 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 11:15:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:15:39,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:15:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179557359] [2023-12-23 11:15:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179557359] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 11:15:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 11:15:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-12-23 11:15:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677861620] [2023-12-23 11:15:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:15:39,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-23 11:15:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:15:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-23 11:15:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:15:39,425 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:15:41,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:15:46,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:15:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:15:46,440 INFO L93 Difference]: Finished difference Result 217 states and 308 transitions. [2023-12-23 11:15:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 11:15:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2023-12-23 11:15:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:15:46,446 INFO L225 Difference]: With dead ends: 217 [2023-12-23 11:15:46,446 INFO L226 Difference]: Without dead ends: 127 [2023-12-23 11:15:46,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=48, Invalid=116, Unknown=4, NotChecked=72, Total=240 [2023-12-23 11:15:46,447 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-23 11:15:46,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 321 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 244 Unchecked, 7.0s Time] [2023-12-23 11:15:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-23 11:15:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2023-12-23 11:15:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:15:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2023-12-23 11:15:46,462 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 200 [2023-12-23 11:15:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:15:46,463 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2023-12-23 11:15:46,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:15:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2023-12-23 11:15:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-23 11:15:46,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:15:46,464 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:15:46,485 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 (7)] Forceful destruction successful, exit code 0 [2023-12-23 11:15:46,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:15:46,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:15:46,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:15:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash -850104228, now seen corresponding path program 1 times [2023-12-23 11:15:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:15:46,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412491837] [2023-12-23 11:15:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:15:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 11:15:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:15:46,667 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 11:15:46,689 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 (8)] Waiting until timeout for monitored process [2023-12-23 11:15:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:15:47,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 11:15:47,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:16:41,733 WARN L293 SmtUtils]: Spent 5.35s 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) Received shutdown request... [2023-12-23 11:16:43,774 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 11:16:43,775 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 11:16:44,806 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 (8)] Forceful destruction successful, exit code 0 [2023-12-23 11:16:44,984 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 11:16:45,032 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 11:16:45,033 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 201 with TraceHistMax 33,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 11:16:45,036 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-23 11:16:45,040 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 11:16:45,046 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 11:16:45,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 11:16:45 BoogieIcfgContainer [2023-12-23 11:16:45,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 11:16:45,049 INFO L158 Benchmark]: Toolchain (without parser) took 886901.54ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 130.9MB in the beginning and 223.8MB in the end (delta: -93.0MB). Peak memory consumption was 140.9MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,049 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 11:16:45,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.06ms. Allocated memory is still 184.5MB. Free memory was 130.9MB in the beginning and 115.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 112.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,050 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 108.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,050 INFO L158 Benchmark]: RCFGBuilder took 14280.52ms. Allocated memory is still 184.5MB. Free memory was 108.3MB in the beginning and 81.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,050 INFO L158 Benchmark]: TraceAbstraction took 872277.97ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 80.5MB in the beginning and 223.8MB in the end (delta: -143.3MB). Peak memory consumption was 90.5MB. Max. memory is 8.0GB. [2023-12-23 11:16:45,055 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.16ms. Allocated memory is still 184.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.06ms. Allocated memory is still 184.5MB. Free memory was 130.9MB in the beginning and 115.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 112.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 108.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 14280.52ms. Allocated memory is still 184.5MB. Free memory was 108.3MB in the beginning and 81.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 872277.97ms. Allocated memory was 184.5MB in the beginning and 267.4MB in the end (delta: 82.8MB). Free memory was 80.5MB in the beginning and 223.8MB in the end (delta: -143.3MB). Peak memory consumption was 90.5MB. 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 201 with TraceHistMax 33,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 872.2s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 1701 SdHoareTripleChecker+Invalid, 29.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 730 IncrementalHoareTripleChecker+Unchecked, 1015 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 718 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 686 mSDtfsCounter, 718 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 2135 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 76.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=4, InterpolantAutomatonStates: 44, 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, 6 MinimizatonAttempts, 166 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 774.3s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 2189 ConstructedInterpolants, 0 QuantifiedInterpolants, 40025 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1972 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 22620/23232 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