/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-91.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 09:05:13,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 09:05:13,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 09:05:13,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 09:05:13,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 09:05:13,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 09:05:13,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 09:05:13,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 09:05:13,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 09:05:13,367 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 09:05:13,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 09:05:13,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 09:05:13,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 09:05:13,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 09:05:13,369 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 09:05:13,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 09:05:13,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 09:05:13,370 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 09:05:13,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 09:05:13,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 09:05:13,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 09:05:13,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 09:05:13,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 09:05:13,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 09:05:13,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 09:05:13,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 09:05:13,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 09:05:13,372 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 09:05:13,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 09:05:13,373 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 09:05:13,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 09:05:13,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 09:05:13,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 09:05:13,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 09:05:13,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:05:13,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 09:05:13,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 09:05:13,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 09:05:13,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 09:05:13,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 09:05:13,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 09:05:13,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 09:05:13,376 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 09:05:13,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 09:05:13,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 09:05:13,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 09:05:13,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 09:05:13,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 09:05:13,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 09:05:13,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 09:05:13,636 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 09:05:13,636 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 09:05:13,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-91.i [2023-12-24 09:05:14,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 09:05:14,868 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 09:05:14,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-91.i [2023-12-24 09:05:14,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97ed9eaa/e07b6ac411d044b7b847ed4d2b70788f/FLAG144def68e [2023-12-24 09:05:14,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97ed9eaa/e07b6ac411d044b7b847ed4d2b70788f [2023-12-24 09:05:14,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 09:05:14,894 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 09:05:14,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 09:05:14,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 09:05:14,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 09:05:14,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:05:14" (1/1) ... [2023-12-24 09:05:14,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3695f1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:14, skipping insertion in model container [2023-12-24 09:05:14,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:05:14" (1/1) ... [2023-12-24 09:05:14,931 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 09:05:15,034 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-91.i[915,928] [2023-12-24 09:05:15,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:05:15,066 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 09:05:15,074 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-91.i[915,928] [2023-12-24 09:05:15,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:05:15,098 INFO L206 MainTranslator]: Completed translation [2023-12-24 09:05:15,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15 WrapperNode [2023-12-24 09:05:15,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 09:05:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 09:05:15,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 09:05:15,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 09:05:15,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,126 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-12-24 09:05:15,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 09:05:15,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 09:05:15,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 09:05:15,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 09:05:15,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 09:05:15,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 09:05:15,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 09:05:15,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 09:05:15,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 09:05:15,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (1/1) ... [2023-12-24 09:05:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:05:15,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 09:05:15,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 09:05:15,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 09:05:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 09:05:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 09:05:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 09:05:15,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 09:05:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 09:05:15,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 09:05:15,279 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 09:05:15,281 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 09:05:15,573 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 09:05:15,606 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 09:05:15,607 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 09:05:15,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:05:15 BoogieIcfgContainer [2023-12-24 09:05:15,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 09:05:15,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 09:05:15,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 09:05:15,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 09:05:15,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:05:14" (1/3) ... [2023-12-24 09:05:15,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5e4515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:05:15, skipping insertion in model container [2023-12-24 09:05:15,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:05:15" (2/3) ... [2023-12-24 09:05:15,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5e4515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:05:15, skipping insertion in model container [2023-12-24 09:05:15,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:05:15" (3/3) ... [2023-12-24 09:05:15,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-91.i [2023-12-24 09:05:15,627 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 09:05:15,627 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 09:05:15,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 09:05:15,662 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;@439c49ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 09:05:15,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 09:05:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 09:05:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 09:05:15,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:05:15,674 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 09:05:15,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:05:15,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:05:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -393669120, now seen corresponding path program 1 times [2023-12-24 09:05:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:05:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720694417] [2023-12-24 09:05:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:05:15,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:05:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:05:15,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 09:05:15,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 09:05:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:05:15,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 09:05:15,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 09:05:18,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:05:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 09:05:27,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:05:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720694417] [2023-12-24 09:05:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720694417] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:05:27,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:05:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-12-24 09:05:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630856970] [2023-12-24 09:05:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:05:27,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 09:05:27,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:05:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 09:05:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-24 09:05:27,636 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:05:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:05:32,144 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2023-12-24 09:05:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 09:05:32,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2023-12-24 09:05:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:05:32,152 INFO L225 Difference]: With dead ends: 106 [2023-12-24 09:05:32,152 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 09:05:32,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-12-24 09:05:32,157 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 09:05:32,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 09:05:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 09:05:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-12-24 09:05:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 09:05:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2023-12-24 09:05:32,188 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 69 [2023-12-24 09:05:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:05:32,189 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2023-12-24 09:05:32,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:05:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2023-12-24 09:05:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 09:05:32,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:05:32,191 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 09:05:32,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 09:05:32,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:05:32,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:05:32,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:05:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -391822078, now seen corresponding path program 1 times [2023-12-24 09:05:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:05:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108545481] [2023-12-24 09:05:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:05:32,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:05:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:05:32,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 09:05:32,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 09:05:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:05:32,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 09:05:32,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 09:05:34,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:05:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 09:05:39,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:05:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108545481] [2023-12-24 09:05:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108545481] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 09:05:39,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 09:05:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-24 09:05:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989020884] [2023-12-24 09:05:39,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 09:05:39,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 09:05:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:05:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 09:05:39,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-24 09:05:39,942 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-24 09:05:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:05:48,082 INFO L93 Difference]: Finished difference Result 209 states and 279 transitions. [2023-12-24 09:05:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 09:05:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 69 [2023-12-24 09:05:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:05:48,092 INFO L225 Difference]: With dead ends: 209 [2023-12-24 09:05:48,092 INFO L226 Difference]: Without dead ends: 144 [2023-12-24 09:05:48,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=410, Invalid=1072, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 09:05:48,094 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 123 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-24 09:05:48,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 224 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-24 09:05:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-24 09:05:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 46. [2023-12-24 09:05:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 09:05:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2023-12-24 09:05:48,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 69 [2023-12-24 09:05:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:05:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2023-12-24 09:05:48,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-24 09:05:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2023-12-24 09:05:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 09:05:48,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:05:48,107 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 09:05:48,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 09:05:48,313 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-24 09:05:48,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:05:48,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:05:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash 672060435, now seen corresponding path program 1 times [2023-12-24 09:05:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:05:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646644280] [2023-12-24 09:05:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:05:48,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:05:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:05:48,317 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-24 09:05:48,330 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-24 09:05:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:05:48,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 09:05:48,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 09:05:50,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:06:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 09:06:03,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:06:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646644280] [2023-12-24 09:06:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646644280] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:06:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:06:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-12-24 09:06:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546036819] [2023-12-24 09:06:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:06:03,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 09:06:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:06:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 09:06:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-12-24 09:06:03,256 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:06:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:06:27,519 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2023-12-24 09:06:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 09:06:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-24 09:06:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:06:27,527 INFO L225 Difference]: With dead ends: 90 [2023-12-24 09:06:27,527 INFO L226 Difference]: Without dead ends: 88 [2023-12-24 09:06:27,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-12-24 09:06:27,528 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 80 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-12-24 09:06:27,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 174 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-12-24 09:06:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-24 09:06:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 44. [2023-12-24 09:06:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 09:06:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2023-12-24 09:06:27,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 70 [2023-12-24 09:06:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:06:27,546 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2023-12-24 09:06:27,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:06:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2023-12-24 09:06:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 09:06:27,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:06:27,548 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 09:06:27,555 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-24 09:06:27,748 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-24 09:06:27,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:06:27,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:06:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 672000853, now seen corresponding path program 1 times [2023-12-24 09:06:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:06:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648153142] [2023-12-24 09:06:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:06:27,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:06:27,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:06:27,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 09:06:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 09:06:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:06:27,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 09:06:27,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:06:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 09:06:28,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:06:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 09:06:40,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:06:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648153142] [2023-12-24 09:06:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648153142] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:06:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:06:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-24 09:06:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581974964] [2023-12-24 09:06:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:06:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 09:06:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:06:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 09:06:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-24 09:06:40,949 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:07:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:07:03,850 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2023-12-24 09:07:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 09:07:03,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-24 09:07:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:07:03,860 INFO L225 Difference]: With dead ends: 90 [2023-12-24 09:07:03,860 INFO L226 Difference]: Without dead ends: 88 [2023-12-24 09:07:03,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2023-12-24 09:07:03,863 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 92 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-24 09:07:03,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 123 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-12-24 09:07:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-24 09:07:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 46. [2023-12-24 09:07:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 09:07:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2023-12-24 09:07:03,870 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 70 [2023-12-24 09:07:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:07:03,870 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2023-12-24 09:07:03,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:07:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2023-12-24 09:07:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 09:07:03,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:07:03,871 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 09:07:03,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 09:07:04,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:07:04,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:07:04,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:07:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash 729259155, now seen corresponding path program 1 times [2023-12-24 09:07:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:07:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102781798] [2023-12-24 09:07:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:07:04,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:07:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:07:04,085 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 09:07:04,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 09:07:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:07:04,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 09:07:04,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:07:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 09:07:12,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:07:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 09:07:24,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:07:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102781798] [2023-12-24 09:07:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102781798] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 09:07:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 09:07:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-12-24 09:07:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868539837] [2023-12-24 09:07:24,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:07:24,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 09:07:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:07:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 09:07:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-24 09:07:24,109 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:08:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:08:08,383 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2023-12-24 09:08:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 09:08:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-24 09:08:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:08:08,393 INFO L225 Difference]: With dead ends: 88 [2023-12-24 09:08:08,393 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 09:08:08,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-24 09:08:08,396 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 94 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2023-12-24 09:08:08,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 110 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 26.8s Time] [2023-12-24 09:08:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 09:08:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 09:08:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 09:08:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 09:08:08,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2023-12-24 09:08:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:08:08,400 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 09:08:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 09:08:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 09:08:08,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 09:08:08,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 09:08:08,410 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 (6)] Ended with exit code 0 [2023-12-24 09:08:08,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 09:08:08,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 09:08:32,408 WARN L293 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:08:47,118 WARN L293 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:08:56,100 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 167 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:09:13,058 WARN L293 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:09:27,912 WARN L293 SmtUtils]: Spent 14.85s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:09:43,126 WARN L293 SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:09:57,082 WARN L293 SmtUtils]: Spent 13.96s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:10:26,313 WARN L293 SmtUtils]: Spent 29.23s on a formula simplification. DAG size of input: 207 DAG size of output: 47 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:10:43,470 WARN L293 SmtUtils]: Spent 17.16s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:11:00,567 WARN L293 SmtUtils]: Spent 17.07s on a formula simplification. DAG size of input: 90 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:11:00,570 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L899 garLoopResultBuilder]: For program point L81(lines 64 82) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-24 09:11:00,571 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,571 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 09:11:00,572 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 09:11:00,572 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 09:11:00,572 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-24 09:11:00,572 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,572 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 09:11:00,572 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,572 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,572 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 50) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 35 63) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L895 garLoopResultBuilder]: At program point L92-2(lines 92 98) the Hoare annotation is: (let ((.cse6 ((_ zero_extend 16) ~var_1_15~0))) (let ((.cse2 (fp.eq ~var_1_10~0 ~var_1_13~0)) (.cse0 (not (= .cse6 (bvmul .cse6 ~var_1_14~0)))) (.cse1 (and (= .cse6 ~var_1_14~0) (= .cse6 ((_ zero_extend 16) ~var_1_16~0)))) (.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (and (or .cse0 .cse1 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0)))) (or .cse2 (not (fp.geq ~var_1_10~0 .cse3))) (or (not (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0))) .cse2 .cse0) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse4) (fp.geq ~var_1_13~0 .cse5)) (and (fp.geq ~var_1_13~0 (fp.neg .cse4)) (fp.leq ~var_1_13~0 (fp.neg .cse5))))) (or .cse1 (not (fp.geq ~var_1_13~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L92-3(lines 92 98) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 35 63) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.geq ~var_1_13~0 (fp.neg .cse0)) (fp.leq ~var_1_13~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 09:11:00,573 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.geq ~var_1_13~0 (fp.neg .cse0)) (fp.leq ~var_1_13~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 09:11:00,573 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-24 09:11:00,573 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,574 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (let ((.cse15 ((_ zero_extend 16) ~var_1_15~0)) (.cse14 (fp.geq ~var_1_10~0 (fp.add currentRoundingMode ~var_1_10~0 ~var_1_10~0)))) (let ((.cse0 (not .cse14)) (.cse3 (and (= .cse15 ~var_1_14~0) (= .cse15 ((_ zero_extend 16) ~var_1_16~0)))) (.cse4 (= .cse15 (bvmul .cse15 ~var_1_14~0))) (.cse1 (fp.eq ~var_1_10~0 ~var_1_13~0))) (let ((.cse2 (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (/ 252.0 5.0)))) (let ((.cse6 (not (fp.geq ~var_1_10~0 .cse11)))) (let ((.cse5 (or .cse14 .cse1 .cse6)) (.cse7 (or .cse1 .cse6 .cse4)) (.cse8 (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_13~0 .cse12) (fp.geq ~var_1_13~0 .cse13)) (and (fp.geq ~var_1_13~0 (fp.neg .cse12)) (fp.leq ~var_1_13~0 (fp.neg .cse13)))))) (.cse9 (or .cse3 (not (fp.geq ~var_1_13~0 .cse11)))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10))))))) (or (and (or .cse0 .cse1) .cse2 (or .cse3 (not (fp.geq ~var_1_13~0 (fp.add currentRoundingMode ~var_1_13~0 ~var_1_13~0))))) (and (not .cse4) .cse2))))) [2023-12-24 09:11:00,574 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-24 09:11:00,574 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 63) no Hoare annotation was computed. [2023-12-24 09:11:00,574 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 09:11:00,574 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 09:11:00,574 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 09:11:00,574 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 09:11:00,576 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 09:11:00,577 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 09:11:00,599 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 09:11:00,601 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 09:11:00,601 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 09:11:00,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:11:00 BoogieIcfgContainer [2023-12-24 09:11:00,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 09:11:00,602 INFO L158 Benchmark]: Toolchain (without parser) took 345708.26ms. Allocated memory was 312.5MB in the beginning and 666.9MB in the end (delta: 354.4MB). Free memory was 260.5MB in the beginning and 574.0MB in the end (delta: -313.5MB). Peak memory consumption was 385.2MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,602 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 216.0MB. Free memory was 165.3MB in the beginning and 165.1MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 09:11:00,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.22ms. Allocated memory is still 312.5MB. Free memory was 260.5MB in the beginning and 247.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.49ms. Allocated memory is still 312.5MB. Free memory was 247.5MB in the beginning and 245.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,603 INFO L158 Benchmark]: Boogie Preprocessor took 36.30ms. Allocated memory is still 312.5MB. Free memory was 245.8MB in the beginning and 243.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,603 INFO L158 Benchmark]: RCFGBuilder took 436.29ms. Allocated memory is still 312.5MB. Free memory was 243.3MB in the beginning and 226.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,603 INFO L158 Benchmark]: TraceAbstraction took 344992.79ms. Allocated memory was 312.5MB in the beginning and 666.9MB in the end (delta: 354.4MB). Free memory was 225.8MB in the beginning and 574.0MB in the end (delta: -348.2MB). Peak memory consumption was 350.6MB. Max. memory is 8.0GB. [2023-12-24 09:11:00,605 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.15ms. Allocated memory is still 216.0MB. Free memory was 165.3MB in the beginning and 165.1MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.22ms. Allocated memory is still 312.5MB. Free memory was 260.5MB in the beginning and 247.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.49ms. Allocated memory is still 312.5MB. Free memory was 247.5MB in the beginning and 245.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.30ms. Allocated memory is still 312.5MB. Free memory was 245.8MB in the beginning and 243.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 436.29ms. Allocated memory is still 312.5MB. Free memory was 243.3MB in the beginning and 226.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 344992.79ms. Allocated memory was 312.5MB in the beginning and 666.9MB in the end (delta: 354.4MB). Free memory was 225.8MB in the beginning and 574.0MB in the end (delta: -348.2MB). Peak memory consumption was 350.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 344.9s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 172.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 54.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 790 SdHoareTripleChecker+Invalid, 52.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1019 IncrementalHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 258 mSDtfsCounter, 1019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 77.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=1, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 189 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 70 PreInvPairs, 101 NumberOfFragments, 3235 HoareAnnotationTreeSize, 70 FormulaSimplifications, 183848 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 13 FormulaSimplificationsInter, 187990 FormulaSimplificationTreeSizeReductionInter, 164.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 67.0s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 686 ConstructedInterpolants, 3 QuantifiedInterpolants, 5320 SizeOfPredicates, 71 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 2164/2200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 09:11:00,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...