/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-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:01:49,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:01:49,786 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-16 14:01:49,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:01:49,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:01:49,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:01:49,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:01:49,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:01:49,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:01:49,829 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:01:49,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:01:49,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:01:49,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:01:49,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:01:49,831 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:01:49,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:01:49,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:01:49,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:01:49,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:01:49,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:01:49,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:01:49,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:01:49,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:01:49,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:01:49,834 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:01:49,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:01:49,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:01:49,835 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:01:49,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:01:49,835 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:01:49,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:01:49,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:01:49,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:01:49,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:01:49,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:01:49,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:01:49,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:01:49,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:01:49,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:01:49,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:01:49,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:01:49,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:01:49,839 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:01:49,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:01:49,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:01:49,839 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:01:49,840 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-16 14:01:50,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:01:50,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:01:50,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:01:50,127 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:01:50,127 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:01:50,129 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-39.i [2023-12-16 14:01:51,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:01:51,468 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:01:51,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2023-12-16 14:01:51,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe4595bd/b5c03d8a2d144d8a881f2a2641de09be/FLAG636701373 [2023-12-16 14:01:51,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe4595bd/b5c03d8a2d144d8a881f2a2641de09be [2023-12-16 14:01:51,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:01:51,491 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:01:51,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:01:51,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:01:51,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:01:51,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657da0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51, skipping insertion in model container [2023-12-16 14:01:51,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,524 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:01:51,648 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-39.i[915,928] [2023-12-16 14:01:51,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:01:51,715 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:01:51,725 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-39.i[915,928] [2023-12-16 14:01:51,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:01:51,770 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:01:51,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51 WrapperNode [2023-12-16 14:01:51,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:01:51,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:01:51,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:01:51,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:01:51,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,805 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2023-12-16 14:01:51,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:01:51,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:01:51,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:01:51,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:01:51,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,834 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-16 14:01:51,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:01:51,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:01:51,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:01:51,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:01:51,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (1/1) ... [2023-12-16 14:01:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:01:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:01:51,889 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-16 14:01:51,895 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-16 14:01:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:01:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:01:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:01:51,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:01:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:01:51,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:01:51,990 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:01:51,992 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:01:52,293 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:01:52,341 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:01:52,341 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:01:52,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:01:52 BoogieIcfgContainer [2023-12-16 14:01:52,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:01:52,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:01:52,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:01:52,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:01:52,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:01:51" (1/3) ... [2023-12-16 14:01:52,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26006764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:01:52, skipping insertion in model container [2023-12-16 14:01:52,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:01:51" (2/3) ... [2023-12-16 14:01:52,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26006764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:01:52, skipping insertion in model container [2023-12-16 14:01:52,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:01:52" (3/3) ... [2023-12-16 14:01:52,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2023-12-16 14:01:52,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:01:52,371 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:01:52,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:01:52,434 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;@7fcacec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:01:52,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:01:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 14:01:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-16 14:01:52,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:01:52,447 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:01:52,447 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:01:52,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:01:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1160943542, now seen corresponding path program 1 times [2023-12-16 14:01:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:01:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655968929] [2023-12-16 14:01:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:01:52,464 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-16 14:01:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:01:52,468 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-16 14:01:52,473 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-16 14:01:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:01:52,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 14:01:52,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:01:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-16 14:01:52,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:01:52,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:01:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655968929] [2023-12-16 14:01:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655968929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:01:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:01:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 14:01:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196207464] [2023-12-16 14:01:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:01:52,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 14:01:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:01:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 14:01:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 14:01:53,004 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:01:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:01:53,392 INFO L93 Difference]: Finished difference Result 146 states and 264 transitions. [2023-12-16 14:01:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 14:01:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2023-12-16 14:01:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:01:53,403 INFO L225 Difference]: With dead ends: 146 [2023-12-16 14:01:53,403 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 14:01:53,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 14:01:53,411 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 14:01:53,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 152 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 14:01:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 14:01:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2023-12-16 14:01:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 14:01:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-16 14:01:53,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2023-12-16 14:01:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:01:53,473 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-16 14:01:53,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:01:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-16 14:01:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 14:01:53,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:01:53,478 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:01:53,487 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-16 14:01:53,684 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-16 14:01:53,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:01:53,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:01:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1380550262, now seen corresponding path program 1 times [2023-12-16 14:01:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:01:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218043017] [2023-12-16 14:01:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:01:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:01:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:01:53,689 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-16 14:01:53,691 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-16 14:01:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:01:53,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 14:01:53,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:01:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-16 14:01:57,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:01:57,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:01:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218043017] [2023-12-16 14:01:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218043017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:01:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:01:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 14:01:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429139598] [2023-12-16 14:01:57,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:01:57,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 14:01:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:01:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 14:01:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:01:57,455 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:01:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:01:58,388 INFO L93 Difference]: Finished difference Result 244 states and 349 transitions. [2023-12-16 14:01:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 14:01:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-16 14:01:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:01:58,398 INFO L225 Difference]: With dead ends: 244 [2023-12-16 14:01:58,399 INFO L226 Difference]: Without dead ends: 170 [2023-12-16 14:01:58,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 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-16 14:01:58,401 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 104 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 14:01:58,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 289 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 14:01:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-16 14:01:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 124. [2023-12-16 14:01:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-16 14:01:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2023-12-16 14:01:58,438 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 84 [2023-12-16 14:01:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:01:58,440 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2023-12-16 14:01:58,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:01:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2023-12-16 14:01:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 14:01:58,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:01:58,448 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:01:58,457 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-16 14:01:58,654 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-16 14:01:58,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:01:58,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:01:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1380490680, now seen corresponding path program 1 times [2023-12-16 14:01:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:01:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352273289] [2023-12-16 14:01:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:01:58,656 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-16 14:01:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:01:58,657 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-16 14:01:58,661 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-16 14:01:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:01:58,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 14:01:58,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-16 14:02:00,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:02:00,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352273289] [2023-12-16 14:02:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352273289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:02:00,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:02:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 14:02:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936580764] [2023-12-16 14:02:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:02:00,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:02:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:00,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:02:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:02:00,322 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:00,908 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2023-12-16 14:02:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 14:02:00,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-16 14:02:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:00,911 INFO L225 Difference]: With dead ends: 160 [2023-12-16 14:02:00,911 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 14:02:00,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-16 14:02:00,912 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 70 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:00,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 296 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 14:02:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 14:02:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2023-12-16 14:02:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 96 states have internal predecessors, (113), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 14:02:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 217 transitions. [2023-12-16 14:02:00,937 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 217 transitions. Word has length 84 [2023-12-16 14:02:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:00,938 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 217 transitions. [2023-12-16 14:02:00,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 217 transitions. [2023-12-16 14:02:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 14:02:00,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:02:00,940 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:00,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 14:02:01,147 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-16 14:02:01,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:02:01,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:02:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1401111451, now seen corresponding path program 1 times [2023-12-16 14:02:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:02:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702680465] [2023-12-16 14:02:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:01,149 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-16 14:02:01,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:02:01,151 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-16 14:02:01,158 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-16 14:02:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:01,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 14:02:01,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 643 proven. 210 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2023-12-16 14:02:01,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:02:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-12-16 14:02:01,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702680465] [2023-12-16 14:02:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702680465] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:02:01,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:02:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-16 14:02:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642310948] [2023-12-16 14:02:01,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:02:01,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 14:02:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 14:02:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 14:02:01,675 INFO L87 Difference]: Start difference. First operand 153 states and 217 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-16 14:02:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:02,087 INFO L93 Difference]: Finished difference Result 257 states and 351 transitions. [2023-12-16 14:02:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 14:02:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2023-12-16 14:02:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:02,094 INFO L225 Difference]: With dead ends: 257 [2023-12-16 14:02:02,094 INFO L226 Difference]: Without dead ends: 169 [2023-12-16 14:02:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2023-12-16 14:02:02,097 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 151 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:02,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 248 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 14:02:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-16 14:02:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2023-12-16 14:02:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 96 states have internal predecessors, (106), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 14:02:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 210 transitions. [2023-12-16 14:02:02,137 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 210 transitions. Word has length 167 [2023-12-16 14:02:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:02,137 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 210 transitions. [2023-12-16 14:02:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-16 14:02:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 210 transitions. [2023-12-16 14:02:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 14:02:02,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:02:02,140 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:02,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 14:02:02,348 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-16 14:02:02,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:02:02,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:02:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1141649940, now seen corresponding path program 1 times [2023-12-16 14:02:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:02:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333163739] [2023-12-16 14:02:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:02,350 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-16 14:02:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:02:02,351 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-16 14:02:02,351 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-16 14:02:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:02,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 14:02:02,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2023-12-16 14:02:05,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:02:05,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333163739] [2023-12-16 14:02:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333163739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:02:05,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:02:05,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 14:02:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732372137] [2023-12-16 14:02:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:02:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 14:02:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:05,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 14:02:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 14:02:05,685 INFO L87 Difference]: Start difference. First operand 157 states and 210 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:06,131 INFO L93 Difference]: Finished difference Result 216 states and 287 transitions. [2023-12-16 14:02:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 14:02:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 167 [2023-12-16 14:02:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:06,134 INFO L225 Difference]: With dead ends: 216 [2023-12-16 14:02:06,134 INFO L226 Difference]: Without dead ends: 214 [2023-12-16 14:02:06,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:02:06,137 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 67 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:06,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 298 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 14:02:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-16 14:02:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2023-12-16 14:02:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 130 states have internal predecessors, (142), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-16 14:02:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2023-12-16 14:02:06,183 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 167 [2023-12-16 14:02:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:06,184 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2023-12-16 14:02:06,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2023-12-16 14:02:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 14:02:06,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:02:06,186 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:06,195 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-16 14:02:06,392 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-16 14:02:06,393 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:02:06,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:02:06,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1141709522, now seen corresponding path program 1 times [2023-12-16 14:02:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:02:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173510363] [2023-12-16 14:02:06,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:06,394 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-16 14:02:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:02:06,396 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-16 14:02:06,397 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-16 14:02:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:06,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 14:02:06,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 824 proven. 175 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2023-12-16 14:02:08,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:02:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 113 proven. 63 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2023-12-16 14:02:09,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173510363] [2023-12-16 14:02:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173510363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:02:09,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:02:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-12-16 14:02:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875510950] [2023-12-16 14:02:09,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:02:09,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 14:02:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 14:02:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-12-16 14:02:09,667 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-16 14:02:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:11,105 INFO L93 Difference]: Finished difference Result 230 states and 300 transitions. [2023-12-16 14:02:11,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 14:02:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2023-12-16 14:02:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:11,107 INFO L225 Difference]: With dead ends: 230 [2023-12-16 14:02:11,107 INFO L226 Difference]: Without dead ends: 228 [2023-12-16 14:02:11,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 14:02:11,109 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 152 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:11,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 384 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 14:02:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-16 14:02:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 214. [2023-12-16 14:02:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 133 states have internal predecessors, (144), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-16 14:02:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 284 transitions. [2023-12-16 14:02:11,145 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 284 transitions. Word has length 167 [2023-12-16 14:02:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:11,146 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 284 transitions. [2023-12-16 14:02:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 4 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-16 14:02:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2023-12-16 14:02:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 14:02:11,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:02:11,148 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:11,156 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 (7)] Ended with exit code 0 [2023-12-16 14:02:11,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:02:11,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:02:11,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:02:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1298593554, now seen corresponding path program 1 times [2023-12-16 14:02:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:02:11,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457929418] [2023-12-16 14:02:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:11,357 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-16 14:02:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:02:11,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:02:11,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 14:02:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:11,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 14:02:11,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 731 proven. 67 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2023-12-16 14:02:13,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:02:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2023-12-16 14:02:15,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:15,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457929418] [2023-12-16 14:02:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457929418] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 14:02:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 14:02:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2023-12-16 14:02:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693626384] [2023-12-16 14:02:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:02:15,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 14:02:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 14:02:15,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-16 14:02:15,190 INFO L87 Difference]: Start difference. First operand 214 states and 284 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:15,796 INFO L93 Difference]: Finished difference Result 226 states and 297 transitions. [2023-12-16 14:02:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 14:02:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2023-12-16 14:02:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:15,798 INFO L225 Difference]: With dead ends: 226 [2023-12-16 14:02:15,798 INFO L226 Difference]: Without dead ends: 224 [2023-12-16 14:02:15,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2023-12-16 14:02:15,799 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:15,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 207 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 14:02:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-16 14:02:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2023-12-16 14:02:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 132 states have (on average 1.106060606060606) internal successors, (146), 135 states have internal predecessors, (146), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-16 14:02:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 286 transitions. [2023-12-16 14:02:15,832 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 286 transitions. Word has length 168 [2023-12-16 14:02:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:15,833 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 286 transitions. [2023-12-16 14:02:15,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 286 transitions. [2023-12-16 14:02:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 14:02:15,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:02:15,835 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:15,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 14:02:16,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 14:02:16,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:02:16,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:02:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1298533972, now seen corresponding path program 1 times [2023-12-16 14:02:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:02:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071773644] [2023-12-16 14:02:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:16,042 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-16 14:02:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:02:16,043 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-16 14:02:16,045 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-16 14:02:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:16,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 14:02:16,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 833 proven. 229 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-16 14:02:17,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:02:21,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:02:21,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071773644] [2023-12-16 14:02:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071773644] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 14:02:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1800174793] [2023-12-16 14:02:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:02:21,092 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 14:02:21,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 14:02:21,197 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-16 14:02:21,198 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-16 14:02:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:02:21,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 14:02:21,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:02:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 717 proven. 37 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2023-12-16 14:02:27,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:02:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2023-12-16 14:02:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1800174793] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 14:02:29,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:02:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [22, 15] total 43 [2023-12-16 14:02:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160661776] [2023-12-16 14:02:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:02:29,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 14:02:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:02:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 14:02:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 14:02:29,392 INFO L87 Difference]: Start difference. First operand 216 states and 286 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:02:31,131 INFO L93 Difference]: Finished difference Result 220 states and 290 transitions. [2023-12-16 14:02:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 14:02:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2023-12-16 14:02:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:02:31,132 INFO L225 Difference]: With dead ends: 220 [2023-12-16 14:02:31,133 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:02:31,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=440, Invalid=2640, Unknown=0, NotChecked=0, Total=3080 [2023-12-16 14:02:31,135 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 14:02:31,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 157 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 14:02:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:02:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:02:31,136 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-16 14:02:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:02:31,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2023-12-16 14:02:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:02:31,136 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:02:31,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-16 14:02:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:02:31,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:02:31,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:02:31,149 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 (9)] Ended with exit code 0 [2023-12-16 14:02:31,353 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-16 14:02:31,549 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-16 14:02:31,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:02:33,036 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-12-16 14:02:33,036 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (or (and (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,037 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)))) (or (and .cse0 (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and .cse0 (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8))))) [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-12-16 14:02:33,037 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,037 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L895 garLoopResultBuilder]: At program point L94-2(lines 94 100) the Hoare annotation is: (let ((.cse9 ((_ zero_extend 24) ~var_1_14~0))) (let ((.cse8 ((_ extract 15 0) (bvadd (_ bv16 32) .cse9 (bvneg (bvmul (_ bv2 32) .cse9)))))) (let ((.cse3 (not (bvsge ((_ sign_extend 16) ~var_1_3~0) ~last_1_var_1_6~0))) (.cse2 (= ((_ sign_extend 16) ~var_1_1~0) ((_ sign_extend 16) .cse8))) (.cse6 (= ~last_1_var_1_10~0 (_ bv0 8))) (.cse7 (= ~var_1_14~0 (_ bv10 8))) (.cse0 (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32))) (.cse1 (= ~var_1_6~0 .cse9)) (.cse4 (= ~last_1_var_1_10~0 (_ bv1 8))) (.cse5 (= (_ bv1 8) ~var_1_10~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (or .cse6 .cse3) .cse1 .cse7 .cse2 .cse5) (and (= ~var_1_10~0 (_ bv0 8)) .cse6 .cse7) (and .cse0 .cse1 .cse4 (= ~var_1_14~0 ~var_1_16~0) (= ~var_1_1~0 .cse8) .cse5))))) [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point L94-3(lines 94 100) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,038 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-12-16 14:02:33,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,039 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,039 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (or (and (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)) (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8)))) [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-16 14:02:33,039 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-16 14:02:33,040 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)))) (or (and .cse0 (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and .cse0 (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8))))) [2023-12-16 14:02:33,040 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (bvsge ((_ zero_extend 24) ~var_1_13~0) (_ bv1 32)))) (or (and .cse0 (= ~last_1_var_1_10~0 (_ bv1 8)) (= (_ bv1 8) ~var_1_10~0)) (and .cse0 (= ~var_1_10~0 (_ bv0 8)) (= ~last_1_var_1_10~0 (_ bv0 8)) (= ~var_1_14~0 (_ bv10 8))))) [2023-12-16 14:02:33,040 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-16 14:02:33,040 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-16 14:02:33,040 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:02:33,040 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:02:33,040 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:02:33,040 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:02:33,043 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:02:33,045 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:02:33,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:02:33 BoogieIcfgContainer [2023-12-16 14:02:33,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:02:33,059 INFO L158 Benchmark]: Toolchain (without parser) took 41568.10ms. Allocated memory was 199.2MB in the beginning and 794.8MB in the end (delta: 595.6MB). Free memory was 154.3MB in the beginning and 594.5MB in the end (delta: -440.1MB). Peak memory consumption was 460.2MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,059 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 199.2MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:02:33,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.42ms. Allocated memory is still 199.2MB. Free memory was 154.3MB in the beginning and 141.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,060 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 199.2MB. Free memory was 138.9MB in the beginning and 136.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,060 INFO L158 Benchmark]: RCFGBuilder took 491.52ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 119.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,060 INFO L158 Benchmark]: TraceAbstraction took 40714.88ms. Allocated memory was 199.2MB in the beginning and 794.8MB in the end (delta: 595.6MB). Free memory was 119.0MB in the beginning and 594.5MB in the end (delta: -475.5MB). Peak memory consumption was 424.6MB. Max. memory is 8.0GB. [2023-12-16 14:02:33,061 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.17ms. Allocated memory is still 199.2MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.42ms. Allocated memory is still 199.2MB. Free memory was 154.3MB in the beginning and 141.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 199.2MB. Free memory was 138.9MB in the beginning and 136.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 491.52ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 119.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 40714.88ms. Allocated memory was 199.2MB in the beginning and 794.8MB in the end (delta: 595.6MB). Free memory was 119.0MB in the beginning and 594.5MB in the end (delta: -475.5MB). Peak memory consumption was 424.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 713 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 2031 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1614 IncrementalHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 594 mSDtfsCounter, 1614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1971 GetRequests, 1810 SyntacticMatches, 3 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=7, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 120 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 149 PreInvPairs, 227 NumberOfFragments, 408 HoareAnnotationTreeSize, 149 FormulaSimplifications, 12113 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FormulaSimplificationsInter, 5708 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 1256 NumberOfCodeBlocks, 1256 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1913 ConstructedInterpolants, 21 QuantifiedInterpolants, 10586 SizeOfPredicates, 155 NumberOfNonLiveVariables, 1976 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 13398/14233 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: 94]: Loop Invariant Derived loop invariant: (((((((((var_1_13 >= 1) && (var_1_6 == var_1_14)) && (var_1_1 == (((16 + var_1_14) % 4294967296) & 32767))) && !((var_1_3 >= last_1_var_1_6))) && (last_1_var_1_10 == 1)) && (1 == var_1_10)) || ((((((var_1_13 >= 1) && ((last_1_var_1_10 == 0) || !((var_1_3 >= last_1_var_1_6)))) && (var_1_6 == var_1_14)) && (var_1_14 == 10)) && (var_1_1 == (((16 + var_1_14) % 4294967296) & 32767))) && (1 == var_1_10))) || (((var_1_10 == 0) && (last_1_var_1_10 == 0)) && (var_1_14 == 10))) || ((((((var_1_13 >= 1) && (var_1_6 == var_1_14)) && (last_1_var_1_10 == 1)) && (var_1_14 == var_1_16)) && (var_1_1 == (((16 + var_1_14) % 4294967296) & 32767))) && (1 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2023-12-16 14:02:33,103 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 0 Received shutdown request...