/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:35:39,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:35:39,408 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 01:35:39,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:35:39,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:35:39,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:35:39,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:35:39,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:35:39,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:35:39,438 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:35:39,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:35:39,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:35:39,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:35:39,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:35:39,441 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:35:39,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:35:39,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:35:39,441 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:35:39,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:35:39,442 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:35:39,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:35:39,443 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:35:39,443 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:35:39,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:35:39,443 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:35:39,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:35:39,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:35:39,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:35:39,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:35:39,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:35:39,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:35:39,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:35:39,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:35:39,446 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:35:39,446 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 01:35:39,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:35:39,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:35:39,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:35:39,664 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:35:39,665 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:35:39,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-24 01:35:40,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:35:40,895 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:35:40,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-24 01:35:40,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58212216d/d372b1b85b8848bbaedc31a02d9650fe/FLAG3c50e285f [2023-12-24 01:35:40,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58212216d/d372b1b85b8848bbaedc31a02d9650fe [2023-12-24 01:35:40,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:35:40,919 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:35:40,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:35:40,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:35:40,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:35:40,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:35:40" (1/1) ... [2023-12-24 01:35:40,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d87860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:40, skipping insertion in model container [2023-12-24 01:35:40,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:35:40" (1/1) ... [2023-12-24 01:35:40,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:35:41,113 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i[915,928] [2023-12-24 01:35:41,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:35:41,201 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:35:41,217 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i[915,928] [2023-12-24 01:35:41,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:35:41,271 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:35:41,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41 WrapperNode [2023-12-24 01:35:41,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:35:41,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:35:41,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:35:41,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:35:41,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,314 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-12-24 01:35:41,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:35:41,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:35:41,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:35:41,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:35:41,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,343 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 01:35:41,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:35:41,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:35:41,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:35:41,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:35:41,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (1/1) ... [2023-12-24 01:35:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:35:41,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:35:41,404 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 01:35:41,426 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 01:35:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:35:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:35:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:35:41,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:35:41,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:35:41,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:35:41,516 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:35:41,521 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:35:41,782 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:35:41,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:35:41,819 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:35:41,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:35:41 BoogieIcfgContainer [2023-12-24 01:35:41,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:35:41,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:35:41,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:35:41,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:35:41,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:35:40" (1/3) ... [2023-12-24 01:35:41,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553d43ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:35:41, skipping insertion in model container [2023-12-24 01:35:41,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:35:41" (2/3) ... [2023-12-24 01:35:41,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553d43ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:35:41, skipping insertion in model container [2023-12-24 01:35:41,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:35:41" (3/3) ... [2023-12-24 01:35:41,826 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-24 01:35:41,841 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:35:41,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:35:41,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:35:41,882 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;@653f6027, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:35:41,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:35:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 01:35:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-24 01:35:41,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:35:41,894 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:35:41,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:35:41,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:35:41,899 INFO L85 PathProgramCache]: Analyzing trace with hash -349548776, now seen corresponding path program 1 times [2023-12-24 01:35:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:35:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563964723] [2023-12-24 01:35:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:35:41,912 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 01:35:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:35:41,917 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 01:35:41,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 01:35:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:35:42,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:35:42,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:35:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-24 01:35:42,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:35:42,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:35:42,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563964723] [2023-12-24 01:35:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563964723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:35:42,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:35:42,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:35:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481885983] [2023-12-24 01:35:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:35:42,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:35:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:35:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:35:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:35:42,150 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 01:35:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:35:42,213 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2023-12-24 01:35:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:35:42,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-12-24 01:35:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:35:42,227 INFO L225 Difference]: With dead ends: 67 [2023-12-24 01:35:42,227 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 01:35:42,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:35:42,235 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:35:42,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:35:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 01:35:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 01:35:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 01:35:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-12-24 01:35:42,265 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 57 [2023-12-24 01:35:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:35:42,265 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-12-24 01:35:42,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 01:35:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-12-24 01:35:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-24 01:35:42,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:35:42,267 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:35:42,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 01:35:42,469 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 01:35:42,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:35:42,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:35:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1083279452, now seen corresponding path program 1 times [2023-12-24 01:35:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:35:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759024555] [2023-12-24 01:35:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:35:42,471 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 01:35:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:35:42,479 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 01:35:42,480 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 01:35:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:35:42,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 01:35:42,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:35:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 01:35:42,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:35:42,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:35:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759024555] [2023-12-24 01:35:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759024555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:35:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:35:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 01:35:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790031747] [2023-12-24 01:35:42,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:35:42,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 01:35:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:35:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 01:35:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 01:35:42,695 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:35:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:35:42,931 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2023-12-24 01:35:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 01:35:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-12-24 01:35:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:35:42,937 INFO L225 Difference]: With dead ends: 103 [2023-12-24 01:35:42,937 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 01:35:42,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 01:35:42,938 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:35:42,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:35:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 01:35:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2023-12-24 01:35:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:35:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2023-12-24 01:35:42,956 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 57 [2023-12-24 01:35:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:35:42,958 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2023-12-24 01:35:42,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:35:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2023-12-24 01:35:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-24 01:35:42,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:35:42,961 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:35:42,969 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 01:35:43,167 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 01:35:43,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:35:43,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:35:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash 690252442, now seen corresponding path program 1 times [2023-12-24 01:35:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:35:43,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082579527] [2023-12-24 01:35:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:35:43,169 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 01:35:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:35:43,170 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 01:35:43,171 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 01:35:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:35:43,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 01:35:43,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:35:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-24 01:35:43,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:35:43,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:35:43,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082579527] [2023-12-24 01:35:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082579527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:35:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:35:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 01:35:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067894751] [2023-12-24 01:35:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:35:43,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 01:35:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:35:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 01:35:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 01:35:43,393 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 01:35:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:35:43,653 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2023-12-24 01:35:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 01:35:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-12-24 01:35:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:35:43,658 INFO L225 Difference]: With dead ends: 145 [2023-12-24 01:35:43,658 INFO L226 Difference]: Without dead ends: 83 [2023-12-24 01:35:43,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-24 01:35:43,659 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:35:43,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 88 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:35:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-24 01:35:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-12-24 01:35:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:35:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-12-24 01:35:43,670 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 57 [2023-12-24 01:35:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:35:43,671 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-12-24 01:35:43,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 01:35:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-12-24 01:35:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-24 01:35:43,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:35:43,672 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:35:43,679 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 01:35:43,880 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 01:35:43,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:35:43,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:35:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -91506488, now seen corresponding path program 1 times [2023-12-24 01:35:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:35:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500267883] [2023-12-24 01:35:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:35:43,882 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 01:35:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:35:43,883 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 01:35:43,884 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 01:35:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:35:44,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 01:35:44,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:36:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 01:36:45,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:36:45,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:36:45,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500267883] [2023-12-24 01:36:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500267883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:36:45,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:36:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 01:36:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658219284] [2023-12-24 01:36:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:36:45,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 01:36:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:36:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 01:36:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 01:36:45,533 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:36:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:36:45,849 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2023-12-24 01:36:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 01:36:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2023-12-24 01:36:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:36:45,851 INFO L225 Difference]: With dead ends: 120 [2023-12-24 01:36:45,851 INFO L226 Difference]: Without dead ends: 118 [2023-12-24 01:36:45,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-24 01:36:45,852 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:36:45,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 140 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:36:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-24 01:36:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2023-12-24 01:36:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.146341463414634) internal successors, (94), 82 states have internal predecessors, (94), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 01:36:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2023-12-24 01:36:45,867 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 58 [2023-12-24 01:36:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:36:45,867 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2023-12-24 01:36:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:36:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2023-12-24 01:36:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-24 01:36:45,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:36:45,868 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:45,878 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 (5)] Ended with exit code 0 [2023-12-24 01:36:46,073 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 01:36:46,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:36:46,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:36:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1449162629, now seen corresponding path program 1 times [2023-12-24 01:36:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:36:46,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015410093] [2023-12-24 01:36:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:36:46,074 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 01:36:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:36:46,075 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 01:36:46,077 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 01:36:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:36:46,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 01:36:46,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:36:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 01:36:46,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:36:46,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:36:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015410093] [2023-12-24 01:36:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015410093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:36:46,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:36:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 01:36:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245135258] [2023-12-24 01:36:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:36:46,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 01:36:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:36:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 01:36:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 01:36:46,182 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:36:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:36:46,232 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2023-12-24 01:36:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 01:36:46,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2023-12-24 01:36:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:36:46,234 INFO L225 Difference]: With dead ends: 118 [2023-12-24 01:36:46,234 INFO L226 Difference]: Without dead ends: 78 [2023-12-24 01:36:46,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 01:36:46,235 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:36:46,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:36:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-24 01:36:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-24 01:36:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:36:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-12-24 01:36:46,245 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 59 [2023-12-24 01:36:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:36:46,245 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-12-24 01:36:46,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-24 01:36:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-12-24 01:36:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-24 01:36:46,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:36:46,247 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-24 01:36:46,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 01:36:46,451 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 01:36:46,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:36:46,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:36:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1583943509, now seen corresponding path program 1 times [2023-12-24 01:36:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:36:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903715663] [2023-12-24 01:36:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:36:46,453 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 01:36:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:36:46,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 01:36:46,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 01:36:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:36:46,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 01:36:46,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:37:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 278 proven. 1 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-24 01:37:30,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:37:56,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:37:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903715663] [2023-12-24 01:37:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903715663] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:37:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1060231374] [2023-12-24 01:37:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:37:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:37:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:37:56,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:37:56,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 01:37:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:37:56,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 01:37:56,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:39:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 278 proven. 1 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-24 01:39:27,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:39:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1060231374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:39:59,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:39:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 14 [2023-12-24 01:39:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242173247] [2023-12-24 01:39:59,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:39:59,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 01:39:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:39:59,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 01:39:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2023-12-24 01:39:59,287 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 01:40:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:40:00,442 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2023-12-24 01:40:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 01:40:00,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2023-12-24 01:40:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:40:00,443 INFO L225 Difference]: With dead ends: 100 [2023-12-24 01:40:00,443 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 01:40:00,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=352, Invalid=770, Unknown=0, NotChecked=0, Total=1122 [2023-12-24 01:40:00,444 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 01:40:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 87 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 01:40:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 01:40:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2023-12-24 01:40:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:40:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-12-24 01:40:00,452 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 115 [2023-12-24 01:40:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:40:00,452 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-12-24 01:40:00,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 01:40:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-12-24 01:40:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-24 01:40:00,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:40:00,454 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:40:00,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 01:40:00,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-24 01:40:00,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 01:40:00,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:40:00,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:40:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash -191063853, now seen corresponding path program 1 times [2023-12-24 01:40:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:40:00,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40511429] [2023-12-24 01:40:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:40:00,858 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 01:40:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:40:00,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 01:40:00,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 01:40:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:40:00,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 01:40:00,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:41:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 346 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-24 01:41:20,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:42:22,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:42:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40511429] [2023-12-24 01:42:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40511429] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:42:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110331618] [2023-12-24 01:42:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:42:22,180 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:42:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:42:22,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:42:22,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 01:42:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:42:22,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 01:42:22,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:44:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 68 proven. 292 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 01:44:19,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:45:16,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110331618] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:45:16,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:45:16,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 20 [2023-12-24 01:45:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15905744] [2023-12-24 01:45:16,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:45:16,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 01:45:16,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:45:16,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 01:45:16,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2023-12-24 01:45:16,951 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-24 01:45:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:45:29,994 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2023-12-24 01:45:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-24 01:45:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 115 [2023-12-24 01:45:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:45:29,996 INFO L225 Difference]: With dead ends: 154 [2023-12-24 01:45:29,996 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:45:29,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=530, Invalid=2332, Unknown=0, NotChecked=0, Total=2862 [2023-12-24 01:45:29,998 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 139 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-24 01:45:29,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-24 01:45:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:45:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:45:29,998 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 01:45:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:45:29,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2023-12-24 01:45:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:45:29,999 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:45:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-24 01:45:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:45:29,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:45:30,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:45:30,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 01:45:30,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-24 01:45:30,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 01:45:30,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:45:31,641 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L895 garLoopResultBuilder]: At program point L89-2(lines 89 95) the Hoare annotation is: (let ((.cse12 ((_ zero_extend 24) ~var_1_17~0)) (.cse13 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse14 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse11 ((_ zero_extend 24) ~var_1_16~0))) (let ((.cse0 (bvsle .cse11 (_ bv1 32))) (.cse1 (fp.leq ~var_1_14~0 .cse14)) (.cse2 (fp.leq ~var_1_15~0 .cse14)) (.cse3 (fp.geq ~var_1_15~0 .cse13)) (.cse4 (bvsle .cse12 (_ bv1 32))) (.cse5 (fp.geq ~var_1_14~0 .cse13)) (.cse6 (bvsge .cse12 (_ bv1 32))) (.cse7 (= ~var_1_9~0 (_ bv50 8))) (.cse8 (= ~last_1_var_1_9~0 (_ bv50 8))) (.cse9 (bvsge .cse11 (_ bv1 32))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 (= (_ bv0 8) (bvadd ~var_1_7~0 (_ bv56 8))) .cse2 (= ~var_1_13~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 4999999999999.0 5.0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (bvadd ~last_1_var_1_7~0 (_ bv56 8)) (_ bv0 8)) .cse10) (and .cse0 .cse1 (= ~var_1_1~0 ((_ extract 15 0) (bvadd (bvneg (bvmul ((_ zero_extend 24) ~last_1_var_1_7~0) (_ bv2 32))) (_ bv128 32)))) .cse2 (= ~var_1_8~0 ~var_1_18~0) .cse3 .cse4 .cse5 (= ~var_1_8~0 ~var_1_7~0) .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L89-3(lines 89 95) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (bvsle .cse1 (_ bv1 32)) (fp.geq ~var_1_14~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-24 01:45:31,642 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (bvsle .cse3 (_ bv1 32)) (fp.geq ~var_1_14~0 .cse2) (bvsge .cse3 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,643 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (bvsle .cse3 (_ bv1 32)) (fp.geq ~var_1_14~0 .cse2) (bvsge .cse3 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 62) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 48) no Hoare annotation was computed. [2023-12-24 01:45:31,643 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (fp.geq ~var_1_14~0 .cse2) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,644 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (fp.geq ~var_1_14~0 .cse2) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 61) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L76(lines 63 77) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (bvsle .cse3 (_ bv1 32)) (fp.geq ~var_1_14~0 .cse2) (bvsge .cse3 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,644 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ zero_extend 24) ~var_1_17~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (fp.leq ~var_1_14~0 .cse1) (fp.leq ~var_1_15~0 .cse1) (fp.geq ~var_1_15~0 .cse2) (bvsle .cse3 (_ bv1 32)) (fp.geq ~var_1_14~0 .cse2) (bvsge .cse3 (_ bv1 32)) (= ~var_1_9~0 (_ bv50 8)) (= ~last_1_var_1_9~0 (_ bv50 8)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:45:31,644 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:45:31,644 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:45:31,645 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:45:31,647 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:45:31,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:45:31,660 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:45:31,662 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:45:31,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:45:31 BoogieIcfgContainer [2023-12-24 01:45:31,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:45:31,663 INFO L158 Benchmark]: Toolchain (without parser) took 590743.97ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 848.3MB). Free memory was 242.7MB in the beginning and 430.6MB in the end (delta: -187.9MB). Peak memory consumption was 661.0MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,663 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 220.2MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:45:31,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.31ms. Allocated memory is still 295.7MB. Free memory was 242.7MB in the beginning and 230.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.22ms. Allocated memory is still 295.7MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,663 INFO L158 Benchmark]: Boogie Preprocessor took 54.13ms. Allocated memory is still 295.7MB. Free memory was 228.0MB in the beginning and 225.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,664 INFO L158 Benchmark]: RCFGBuilder took 449.70ms. Allocated memory is still 295.7MB. Free memory was 225.4MB in the beginning and 207.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,664 INFO L158 Benchmark]: TraceAbstraction took 589841.29ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 848.3MB). Free memory was 206.5MB in the beginning and 430.6MB in the end (delta: -224.0MB). Peak memory consumption was 625.3MB. Max. memory is 8.0GB. [2023-12-24 01:45:31,665 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 220.2MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 352.31ms. Allocated memory is still 295.7MB. Free memory was 242.7MB in the beginning and 230.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.22ms. Allocated memory is still 295.7MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.13ms. Allocated memory is still 295.7MB. Free memory was 228.0MB in the beginning and 225.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 449.70ms. Allocated memory is still 295.7MB. Free memory was 225.4MB in the beginning and 207.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 589841.29ms. Allocated memory was 295.7MB in the beginning and 1.1GB in the end (delta: 848.3MB). Free memory was 206.5MB in the beginning and 430.6MB in the end (delta: -224.0MB). Peak memory consumption was 625.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 589.8s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 671 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 450 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 221 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 714 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 49.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=4, InterpolantAutomatonStates: 79, 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, 7 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 73 PreInvPairs, 101 NumberOfFragments, 453 HoareAnnotationTreeSize, 73 FormulaSimplifications, 821 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FormulaSimplificationsInter, 3945 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 569.8s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 6438 SizeOfPredicates, 128 NumberOfNonLiveVariables, 1285 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 2269/2576 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: 89]: Loop Invariant Derived loop invariant: (((((((((var_1_16 <= 1) && (0 == ((var_1_7 + 56) % 256))) && (var_1_17 <= 1)) && (var_1_17 >= 1)) && (var_1_9 == 50)) && (last_1_var_1_9 == 50)) && (var_1_16 >= 1)) && (((last_1_var_1_7 + 56) % 256) == 0)) || (((((((((var_1_16 <= 1) && (var_1_1 == (((-((last_1_var_1_7 * 2)) + 128) % 4294967296) & 32767))) && (var_1_8 == var_1_18)) && (var_1_17 <= 1)) && (var_1_8 == var_1_7)) && (var_1_17 >= 1)) && (var_1_9 == 50)) && (last_1_var_1_9 == 50)) && (var_1_16 >= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 01:45:31,881 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 01:45:31,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...