/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:10:25,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:10:25,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:10:25,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:10:25,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:10:25,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:10:25,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:10:25,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:10:25,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:10:25,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:10:25,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:10:25,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:10:25,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:10:25,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:10:25,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:10:25,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:10:25,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:10:25,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:10:25,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:10:25,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:10:25,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:10:25,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:10:25,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:10:25,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:10:25,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:10:25,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:10:25,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:10:25,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:10:25,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:10:25,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:10:25,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:10:25,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:10:25,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:10:25,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:10:25,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:10:25,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:10:25,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:10:25,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:10:25,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:10:25,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:10:25,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:10:25,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 04:10:25,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:10:25,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:10:25,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:10:25,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:10:25,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:10:25,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:10:25,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:10:25,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:10:25,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:10:25,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:10:25,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:25,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:10:25,766 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 04:10:25,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:10:25,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:10:25,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:10:25,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:10:25,935 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:10:25,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c [2022-01-10 04:10:25,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b624bcc9/c5ce84cc21064398b5061004b5c86837/FLAGee1b98431 [2022-01-10 04:10:26,386 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:10:26,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c [2022-01-10 04:10:26,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b624bcc9/c5ce84cc21064398b5061004b5c86837/FLAGee1b98431 [2022-01-10 04:10:26,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b624bcc9/c5ce84cc21064398b5061004b5c86837 [2022-01-10 04:10:26,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:10:26,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:10:26,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:26,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:10:26,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:10:26,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:26" (1/1) ... [2022-01-10 04:10:26,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d5f2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:26, skipping insertion in model container [2022-01-10 04:10:26,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:26" (1/1) ... [2022-01-10 04:10:26,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:10:26,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:10:26,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c[37595,37608] [2022-01-10 04:10:26,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:27,007 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:10:27,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c[37595,37608] [2022-01-10 04:10:27,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:27,049 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:10:27,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27 WrapperNode [2022-01-10 04:10:27,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:27,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:27,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:10:27,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:10:27,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,083 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-10 04:10:27,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:27,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:10:27,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:10:27,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:10:27,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:10:27,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:10:27,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:10:27,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:10:27,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (1/1) ... [2022-01-10 04:10:27,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:10:27,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 04:10:27,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 04:10:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:10:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:10:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:10:27,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:10:27,269 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:10:27,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:10:27,278 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:27,637 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 04:10:27,638 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 04:10:27,638 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:10:27,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:10:27,643 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 04:10:27,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:27 BoogieIcfgContainer [2022-01-10 04:10:27,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:10:27,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:10:27,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:10:27,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:10:27,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:10:26" (1/3) ... [2022-01-10 04:10:27,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb84c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:27, skipping insertion in model container [2022-01-10 04:10:27,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:27" (2/3) ... [2022-01-10 04:10:27,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb84c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:27, skipping insertion in model container [2022-01-10 04:10:27,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:27" (3/3) ... [2022-01-10 04:10:27,650 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2022-01-10 04:10:27,653 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:10:27,654 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:10:27,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:10:27,688 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 04:10:27,689 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:10:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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) [2022-01-10 04:10:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 04:10:27,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:27,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:27,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2022-01-10 04:10:27,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455735783] [2022-01-10 04:10:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:27,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:27,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:27,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:27,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 04:10:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:27,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 04:10:27,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:27,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:27,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:27,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455735783] [2022-01-10 04:10:27,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455735783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:27,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:27,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:27,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055516567] [2022-01-10 04:10:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:27,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:27,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:27,987 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-01-10 04:10:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:28,099 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2022-01-10 04:10:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2022-01-10 04:10:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:28,107 INFO L225 Difference]: With dead ends: 252 [2022-01-10 04:10:28,107 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 04:10:28,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:28,111 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:28,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 04:10:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-01-10 04:10:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 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) [2022-01-10 04:10:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-01-10 04:10:28,138 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-01-10 04:10:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:28,138 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-01-10 04:10:28,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-01-10 04:10:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-01-10 04:10:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 04:10:28,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:28,141 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:28,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:28,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:28,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2022-01-10 04:10:28,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:28,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948825721] [2022-01-10 04:10:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:28,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:28,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:28,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 04:10:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:28,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:28,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:28,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:28,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948825721] [2022-01-10 04:10:28,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948825721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:28,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:28,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:28,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565612336] [2022-01-10 04:10:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:28,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:28,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:28,455 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-01-10 04:10:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:28,534 INFO L93 Difference]: Finished difference Result 238 states and 360 transitions. [2022-01-10 04:10:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2022-01-10 04:10:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:28,536 INFO L225 Difference]: With dead ends: 238 [2022-01-10 04:10:28,536 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 04:10:28,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:28,537 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:28,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 04:10:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2022-01-10 04:10:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 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) [2022-01-10 04:10:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2022-01-10 04:10:28,544 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2022-01-10 04:10:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:28,544 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2022-01-10 04:10:28,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-01-10 04:10:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2022-01-10 04:10:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 04:10:28,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:28,545 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:28,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 04:10:28,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:28,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash 356453796, now seen corresponding path program 1 times [2022-01-10 04:10:28,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:28,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131296624] [2022-01-10 04:10:28,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:28,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:28,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:28,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 04:10:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:28,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:28,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 04:10:28,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:28,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131296624] [2022-01-10 04:10:28,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131296624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:28,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:28,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:28,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444560858] [2022-01-10 04:10:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:28,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:28,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:28,899 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2022-01-10 04:10:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:28,996 INFO L93 Difference]: Finished difference Result 272 states and 408 transitions. [2022-01-10 04:10:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 51 [2022-01-10 04:10:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:28,998 INFO L225 Difference]: With dead ends: 272 [2022-01-10 04:10:28,998 INFO L226 Difference]: Without dead ends: 152 [2022-01-10 04:10:28,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:28,999 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:29,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 257 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-01-10 04:10:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-01-10 04:10:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 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) [2022-01-10 04:10:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-01-10 04:10:29,019 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2022-01-10 04:10:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:29,020 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-01-10 04:10:29,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2022-01-10 04:10:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-01-10 04:10:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 04:10:29,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:29,021 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:29,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:29,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:29,228 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1238030766, now seen corresponding path program 1 times [2022-01-10 04:10:29,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:29,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096726112] [2022-01-10 04:10:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:29,229 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:29,230 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:29,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 04:10:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:29,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 04:10:29,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:29,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:29,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096726112] [2022-01-10 04:10:29,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096726112] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:29,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:29,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:29,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220765717] [2022-01-10 04:10:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:29,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:29,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:29,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:29,369 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 04:10:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:29,479 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2022-01-10 04:10:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 68 [2022-01-10 04:10:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:29,481 INFO L225 Difference]: With dead ends: 327 [2022-01-10 04:10:29,482 INFO L226 Difference]: Without dead ends: 190 [2022-01-10 04:10:29,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:29,483 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:29,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 239 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-01-10 04:10:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-01-10 04:10:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 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) [2022-01-10 04:10:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2022-01-10 04:10:29,492 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 68 [2022-01-10 04:10:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:29,492 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2022-01-10 04:10:29,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 04:10:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2022-01-10 04:10:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 04:10:29,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:29,493 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:29,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 04:10:29,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:29,702 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1251498196, now seen corresponding path program 1 times [2022-01-10 04:10:29,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:29,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225828180] [2022-01-10 04:10:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:29,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:29,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:29,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 04:10:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 04:10:29,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:29,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:29,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225828180] [2022-01-10 04:10:29,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225828180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:29,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:29,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:29,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118444786] [2022-01-10 04:10:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:29,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:29,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:29,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:29,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:29,934 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 04:10:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:30,048 INFO L93 Difference]: Finished difference Result 388 states and 545 transitions. [2022-01-10 04:10:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 68 [2022-01-10 04:10:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:30,049 INFO L225 Difference]: With dead ends: 388 [2022-01-10 04:10:30,050 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 04:10:30,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:30,051 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:30,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 04:10:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-01-10 04:10:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 205 states have internal predecessors, (283), 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) [2022-01-10 04:10:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2022-01-10 04:10:30,066 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 68 [2022-01-10 04:10:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:30,067 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2022-01-10 04:10:30,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 04:10:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2022-01-10 04:10:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 04:10:30,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:30,068 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:30,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:30,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:30,274 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1821092144, now seen corresponding path program 1 times [2022-01-10 04:10:30,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:30,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463253347] [2022-01-10 04:10:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:30,275 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:30,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:30,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:30,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 04:10:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:30,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:30,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 04:10:30,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:30,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:30,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463253347] [2022-01-10 04:10:30,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463253347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:30,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:30,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:30,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428332771] [2022-01-10 04:10:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:30,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:30,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:30,463 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-01-10 04:10:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:30,546 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2022-01-10 04:10:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 85 [2022-01-10 04:10:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:30,547 INFO L225 Difference]: With dead ends: 426 [2022-01-10 04:10:30,547 INFO L226 Difference]: Without dead ends: 230 [2022-01-10 04:10:30,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:30,548 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:30,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-10 04:10:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2022-01-10 04:10:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 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) [2022-01-10 04:10:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2022-01-10 04:10:30,553 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 85 [2022-01-10 04:10:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:30,553 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2022-01-10 04:10:30,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-01-10 04:10:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2022-01-10 04:10:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 04:10:30,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:30,554 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:30,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 04:10:30,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:30,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1901861672, now seen corresponding path program 1 times [2022-01-10 04:10:30,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:30,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035210518] [2022-01-10 04:10:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:30,762 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:30,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:30,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 04:10:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:30,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:30,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 04:10:30,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:30,983 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:30,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035210518] [2022-01-10 04:10:30,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035210518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:30,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:30,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:30,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135090690] [2022-01-10 04:10:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:30,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:30,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:30,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:30,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:30,984 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-01-10 04:10:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:31,006 INFO L93 Difference]: Finished difference Result 658 states and 897 transitions. [2022-01-10 04:10:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) Word has length 105 [2022-01-10 04:10:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:31,008 INFO L225 Difference]: With dead ends: 658 [2022-01-10 04:10:31,008 INFO L226 Difference]: Without dead ends: 441 [2022-01-10 04:10:31,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:31,009 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:31,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-01-10 04:10:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2022-01-10 04:10:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.3545454545454545) internal successors, (596), 440 states have internal predecessors, (596), 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) [2022-01-10 04:10:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 596 transitions. [2022-01-10 04:10:31,016 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 596 transitions. Word has length 105 [2022-01-10 04:10:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:31,016 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 596 transitions. [2022-01-10 04:10:31,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-01-10 04:10:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 596 transitions. [2022-01-10 04:10:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 04:10:31,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:31,017 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:31,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:31,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:31,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash 837467901, now seen corresponding path program 1 times [2022-01-10 04:10:31,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:31,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353136962] [2022-01-10 04:10:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:31,225 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:31,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:31,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 04:10:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:31,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:31,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 04:10:31,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:31,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:31,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353136962] [2022-01-10 04:10:31,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353136962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:31,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:31,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:31,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026912187] [2022-01-10 04:10:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:31,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:31,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:31,402 INFO L87 Difference]: Start difference. First operand 441 states and 596 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-01-10 04:10:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:31,415 INFO L93 Difference]: Finished difference Result 893 states and 1206 transitions. [2022-01-10 04:10:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) Word has length 106 [2022-01-10 04:10:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:31,417 INFO L225 Difference]: With dead ends: 893 [2022-01-10 04:10:31,417 INFO L226 Difference]: Without dead ends: 462 [2022-01-10 04:10:31,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:31,418 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:31,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-01-10 04:10:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2022-01-10 04:10:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.351409978308026) internal successors, (623), 461 states have internal predecessors, (623), 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) [2022-01-10 04:10:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 623 transitions. [2022-01-10 04:10:31,424 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 623 transitions. Word has length 106 [2022-01-10 04:10:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:31,425 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 623 transitions. [2022-01-10 04:10:31,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-01-10 04:10:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 623 transitions. [2022-01-10 04:10:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 04:10:31,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:31,426 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:31,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:31,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:31,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1077707647, now seen corresponding path program 1 times [2022-01-10 04:10:31,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:31,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622903025] [2022-01-10 04:10:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:31,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:31,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:31,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 04:10:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:31,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:31,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-10 04:10:31,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:31,903 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622903025] [2022-01-10 04:10:31,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622903025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:31,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:31,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:31,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271830570] [2022-01-10 04:10:31,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:31,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:31,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:31,904 INFO L87 Difference]: Start difference. First operand 462 states and 623 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-01-10 04:10:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:31,918 INFO L93 Difference]: Finished difference Result 941 states and 1267 transitions. [2022-01-10 04:10:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 106 [2022-01-10 04:10:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:31,920 INFO L225 Difference]: With dead ends: 941 [2022-01-10 04:10:31,920 INFO L226 Difference]: Without dead ends: 489 [2022-01-10 04:10:31,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:31,921 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:31,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 315 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-01-10 04:10:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2022-01-10 04:10:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.346311475409836) internal successors, (657), 488 states have internal predecessors, (657), 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) [2022-01-10 04:10:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 657 transitions. [2022-01-10 04:10:31,942 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 657 transitions. Word has length 106 [2022-01-10 04:10:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:31,942 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 657 transitions. [2022-01-10 04:10:31,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-01-10 04:10:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 657 transitions. [2022-01-10 04:10:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 04:10:31,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:31,943 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:31,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 04:10:32,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:32,150 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2015927886, now seen corresponding path program 1 times [2022-01-10 04:10:32,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:32,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573741770] [2022-01-10 04:10:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:32,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:32,152 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:32,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:10:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:32,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:32,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 04:10:32,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:32,351 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:32,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573741770] [2022-01-10 04:10:32,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573741770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:32,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:32,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:32,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694374544] [2022-01-10 04:10:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:32,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:32,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:32,352 INFO L87 Difference]: Start difference. First operand 489 states and 657 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2022-01-10 04:10:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:32,377 INFO L93 Difference]: Finished difference Result 1094 states and 1487 transitions. [2022-01-10 04:10:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:32,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) Word has length 107 [2022-01-10 04:10:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:32,379 INFO L225 Difference]: With dead ends: 1094 [2022-01-10 04:10:32,380 INFO L226 Difference]: Without dead ends: 642 [2022-01-10 04:10:32,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:32,380 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:32,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 464 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-01-10 04:10:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2022-01-10 04:10:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.360374414976599) internal successors, (872), 641 states have internal predecessors, (872), 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) [2022-01-10 04:10:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 872 transitions. [2022-01-10 04:10:32,389 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 872 transitions. Word has length 107 [2022-01-10 04:10:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:32,389 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 872 transitions. [2022-01-10 04:10:32,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2022-01-10 04:10:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 872 transitions. [2022-01-10 04:10:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 04:10:32,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:32,390 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:32,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:32,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:32,596 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2145025904, now seen corresponding path program 1 times [2022-01-10 04:10:32,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977873671] [2022-01-10 04:10:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:32,597 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:32,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:32,598 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:32,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:10:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:32,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:32,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 04:10:32,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:32,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977873671] [2022-01-10 04:10:32,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977873671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:32,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:32,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:32,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418155185] [2022-01-10 04:10:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:32,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:32,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:32,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:32,784 INFO L87 Difference]: Start difference. First operand 642 states and 872 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2022-01-10 04:10:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:32,797 INFO L93 Difference]: Finished difference Result 1272 states and 1727 transitions. [2022-01-10 04:10:32,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 107 [2022-01-10 04:10:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:32,801 INFO L225 Difference]: With dead ends: 1272 [2022-01-10 04:10:32,801 INFO L226 Difference]: Without dead ends: 667 [2022-01-10 04:10:32,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:32,802 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:32,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 352 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-01-10 04:10:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2022-01-10 04:10:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.3543543543543544) internal successors, (902), 666 states have internal predecessors, (902), 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) [2022-01-10 04:10:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 902 transitions. [2022-01-10 04:10:32,811 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 902 transitions. Word has length 107 [2022-01-10 04:10:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:32,811 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 902 transitions. [2022-01-10 04:10:32,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2022-01-10 04:10:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 902 transitions. [2022-01-10 04:10:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 04:10:32,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:32,813 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:32,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:33,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:33,020 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1870688019, now seen corresponding path program 1 times [2022-01-10 04:10:33,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:33,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714510323] [2022-01-10 04:10:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:33,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:33,033 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:33,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 04:10:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:33,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:33,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 04:10:33,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:33,283 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714510323] [2022-01-10 04:10:33,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714510323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:33,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:33,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:33,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198757070] [2022-01-10 04:10:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:33,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:33,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:33,285 INFO L87 Difference]: Start difference. First operand 667 states and 902 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2022-01-10 04:10:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:33,349 INFO L93 Difference]: Finished difference Result 1377 states and 1893 transitions. [2022-01-10 04:10:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) Word has length 162 [2022-01-10 04:10:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:33,351 INFO L225 Difference]: With dead ends: 1377 [2022-01-10 04:10:33,351 INFO L226 Difference]: Without dead ends: 747 [2022-01-10 04:10:33,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:33,352 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:33,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 260 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-10 04:10:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2022-01-10 04:10:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.3414965986394558) internal successors, (986), 735 states have internal predecessors, (986), 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) [2022-01-10 04:10:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 986 transitions. [2022-01-10 04:10:33,375 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 986 transitions. Word has length 162 [2022-01-10 04:10:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:33,375 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 986 transitions. [2022-01-10 04:10:33,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2022-01-10 04:10:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 986 transitions. [2022-01-10 04:10:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 04:10:33,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:33,377 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:33,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 04:10:33,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:33,586 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1430832159, now seen corresponding path program 1 times [2022-01-10 04:10:33,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:33,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434285149] [2022-01-10 04:10:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:33,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:33,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:33,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 04:10:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:33,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:33,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-01-10 04:10:33,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:33,891 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434285149] [2022-01-10 04:10:33,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434285149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:33,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:33,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:33,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478606345] [2022-01-10 04:10:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:33,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:33,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:33,892 INFO L87 Difference]: Start difference. First operand 736 states and 986 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2022-01-10 04:10:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:34,019 INFO L93 Difference]: Finished difference Result 1519 states and 2074 transitions. [2022-01-10 04:10:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) Word has length 183 [2022-01-10 04:10:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:34,021 INFO L225 Difference]: With dead ends: 1519 [2022-01-10 04:10:34,021 INFO L226 Difference]: Without dead ends: 820 [2022-01-10 04:10:34,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:34,024 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 19 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:34,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 262 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-01-10 04:10:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 811. [2022-01-10 04:10:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.328395061728395) internal successors, (1076), 810 states have internal predecessors, (1076), 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) [2022-01-10 04:10:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1076 transitions. [2022-01-10 04:10:34,043 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1076 transitions. Word has length 183 [2022-01-10 04:10:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:34,043 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1076 transitions. [2022-01-10 04:10:34,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2022-01-10 04:10:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1076 transitions. [2022-01-10 04:10:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-10 04:10:34,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:34,045 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:34,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:34,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:34,252 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash -344845806, now seen corresponding path program 1 times [2022-01-10 04:10:34,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071068850] [2022-01-10 04:10:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:34,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:34,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 04:10:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:34,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:34,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-01-10 04:10:34,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:34,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:34,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071068850] [2022-01-10 04:10:34,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071068850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:34,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:34,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:34,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241331] [2022-01-10 04:10:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:34,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:34,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:34,578 INFO L87 Difference]: Start difference. First operand 811 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-01-10 04:10:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:34,670 INFO L93 Difference]: Finished difference Result 1675 states and 2263 transitions. [2022-01-10 04:10:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) Word has length 207 [2022-01-10 04:10:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:34,673 INFO L225 Difference]: With dead ends: 1675 [2022-01-10 04:10:34,673 INFO L226 Difference]: Without dead ends: 901 [2022-01-10 04:10:34,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:34,674 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:34,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-01-10 04:10:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 895. [2022-01-10 04:10:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.3143176733780761) internal successors, (1175), 894 states have internal predecessors, (1175), 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) [2022-01-10 04:10:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1175 transitions. [2022-01-10 04:10:34,686 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1175 transitions. Word has length 207 [2022-01-10 04:10:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:34,686 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 1175 transitions. [2022-01-10 04:10:34,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-01-10 04:10:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1175 transitions. [2022-01-10 04:10:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-10 04:10:34,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:34,688 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:34,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:34,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:34,895 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash 494187856, now seen corresponding path program 1 times [2022-01-10 04:10:34,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315802689] [2022-01-10 04:10:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:34,896 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:34,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:34,916 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:34,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 04:10:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:35,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:35,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-01-10 04:10:35,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:35,183 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315802689] [2022-01-10 04:10:35,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315802689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:35,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:35,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:35,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126879691] [2022-01-10 04:10:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:35,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:35,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:35,185 INFO L87 Difference]: Start difference. First operand 895 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-01-10 04:10:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:35,286 INFO L93 Difference]: Finished difference Result 1855 states and 2488 transitions. [2022-01-10 04:10:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) Word has length 207 [2022-01-10 04:10:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:35,288 INFO L225 Difference]: With dead ends: 1855 [2022-01-10 04:10:35,288 INFO L226 Difference]: Without dead ends: 997 [2022-01-10 04:10:35,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:35,291 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 25 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:35,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 263 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-01-10 04:10:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 988. [2022-01-10 04:10:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.2998986828774062) internal successors, (1283), 987 states have internal predecessors, (1283), 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) [2022-01-10 04:10:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1283 transitions. [2022-01-10 04:10:35,302 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1283 transitions. Word has length 207 [2022-01-10 04:10:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:35,303 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 1283 transitions. [2022-01-10 04:10:35,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-01-10 04:10:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1283 transitions. [2022-01-10 04:10:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-01-10 04:10:35,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:35,305 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:35,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:35,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:35,512 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1462110578, now seen corresponding path program 1 times [2022-01-10 04:10:35,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195001023] [2022-01-10 04:10:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:35,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:35,513 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:35,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 04:10:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 04:10:35,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:35,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:35,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195001023] [2022-01-10 04:10:35,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195001023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:35,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:35,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:35,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049172912] [2022-01-10 04:10:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:35,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:35,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:35,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:35,826 INFO L87 Difference]: Start difference. First operand 988 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2022-01-10 04:10:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:35,843 INFO L93 Difference]: Finished difference Result 2803 states and 3651 transitions. [2022-01-10 04:10:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) Word has length 237 [2022-01-10 04:10:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:35,848 INFO L225 Difference]: With dead ends: 2803 [2022-01-10 04:10:35,848 INFO L226 Difference]: Without dead ends: 1852 [2022-01-10 04:10:35,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:35,851 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:35,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 483 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-01-10 04:10:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1850. [2022-01-10 04:10:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 1.302866414277988) internal successors, (2409), 1849 states have internal predecessors, (2409), 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) [2022-01-10 04:10:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2409 transitions. [2022-01-10 04:10:35,874 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2409 transitions. Word has length 237 [2022-01-10 04:10:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:35,874 INFO L470 AbstractCegarLoop]: Abstraction has 1850 states and 2409 transitions. [2022-01-10 04:10:35,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2022-01-10 04:10:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2409 transitions. [2022-01-10 04:10:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-01-10 04:10:35,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:35,877 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:35,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 04:10:36,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:36,084 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1993823056, now seen corresponding path program 1 times [2022-01-10 04:10:36,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:36,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433192308] [2022-01-10 04:10:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:36,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:36,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:36,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:36,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 04:10:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:36,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:36,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-01-10 04:10:36,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:36,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:36,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433192308] [2022-01-10 04:10:36,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433192308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:36,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:36,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:36,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215433287] [2022-01-10 04:10:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:36,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:36,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:36,491 INFO L87 Difference]: Start difference. First operand 1850 states and 2409 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2022-01-10 04:10:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:36,627 INFO L93 Difference]: Finished difference Result 3894 states and 5187 transitions. [2022-01-10 04:10:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) Word has length 237 [2022-01-10 04:10:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:36,634 INFO L225 Difference]: With dead ends: 3894 [2022-01-10 04:10:36,634 INFO L226 Difference]: Without dead ends: 2081 [2022-01-10 04:10:36,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:36,636 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:36,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 262 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2022-01-10 04:10:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2069. [2022-01-10 04:10:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2068 states have (on average 1.2852998065764023) internal successors, (2658), 2068 states have internal predecessors, (2658), 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) [2022-01-10 04:10:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2658 transitions. [2022-01-10 04:10:36,672 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2658 transitions. Word has length 237 [2022-01-10 04:10:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:36,673 INFO L470 AbstractCegarLoop]: Abstraction has 2069 states and 2658 transitions. [2022-01-10 04:10:36,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2022-01-10 04:10:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2658 transitions. [2022-01-10 04:10:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-01-10 04:10:36,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:36,677 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:36,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:36,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:36,888 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1339436024, now seen corresponding path program 1 times [2022-01-10 04:10:36,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:36,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177997377] [2022-01-10 04:10:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:36,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:36,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:36,890 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:36,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 04:10:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:37,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:37,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-01-10 04:10:37,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:37,362 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177997377] [2022-01-10 04:10:37,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177997377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:37,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:37,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:37,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724609902] [2022-01-10 04:10:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:37,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:37,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:37,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:37,363 INFO L87 Difference]: Start difference. First operand 2069 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) [2022-01-10 04:10:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:37,482 INFO L93 Difference]: Finished difference Result 4212 states and 5466 transitions. [2022-01-10 04:10:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) Word has length 261 [2022-01-10 04:10:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:37,512 INFO L225 Difference]: With dead ends: 4212 [2022-01-10 04:10:37,512 INFO L226 Difference]: Without dead ends: 2180 [2022-01-10 04:10:37,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:37,514 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 26 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:37,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 262 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2022-01-10 04:10:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2168. [2022-01-10 04:10:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2167 states have (on average 1.2791878172588833) internal successors, (2772), 2167 states have internal predecessors, (2772), 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) [2022-01-10 04:10:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2772 transitions. [2022-01-10 04:10:37,565 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2772 transitions. Word has length 261 [2022-01-10 04:10:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:37,565 INFO L470 AbstractCegarLoop]: Abstraction has 2168 states and 2772 transitions. [2022-01-10 04:10:37,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) [2022-01-10 04:10:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2772 transitions. [2022-01-10 04:10:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-01-10 04:10:37,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:37,568 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:37,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:37,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:37,776 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 699905623, now seen corresponding path program 1 times [2022-01-10 04:10:37,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:37,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768866569] [2022-01-10 04:10:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:37,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:37,778 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:37,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 04:10:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:37,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:37,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-01-10 04:10:38,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:38,201 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768866569] [2022-01-10 04:10:38,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768866569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:38,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:38,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:38,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576897403] [2022-01-10 04:10:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:38,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:38,202 INFO L87 Difference]: Start difference. First operand 2168 states and 2772 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2022-01-10 04:10:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:38,308 INFO L93 Difference]: Finished difference Result 4533 states and 5928 transitions. [2022-01-10 04:10:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) Word has length 272 [2022-01-10 04:10:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:38,314 INFO L225 Difference]: With dead ends: 4533 [2022-01-10 04:10:38,314 INFO L226 Difference]: Without dead ends: 2402 [2022-01-10 04:10:38,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:38,317 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 31 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:38,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 258 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-01-10 04:10:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2390. [2022-01-10 04:10:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2389 states have (on average 1.265801590623692) internal successors, (3024), 2389 states have internal predecessors, (3024), 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) [2022-01-10 04:10:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3024 transitions. [2022-01-10 04:10:38,347 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3024 transitions. Word has length 272 [2022-01-10 04:10:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:38,347 INFO L470 AbstractCegarLoop]: Abstraction has 2390 states and 3024 transitions. [2022-01-10 04:10:38,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2022-01-10 04:10:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3024 transitions. [2022-01-10 04:10:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-10 04:10:38,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:38,351 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:38,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:38,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:38,558 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1408099866, now seen corresponding path program 1 times [2022-01-10 04:10:38,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189795977] [2022-01-10 04:10:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:38,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:38,560 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:38,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 04:10:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:38,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:38,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 04:10:39,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:39,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189795977] [2022-01-10 04:10:39,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189795977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:39,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:39,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:39,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168387993] [2022-01-10 04:10:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:39,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:39,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:39,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:39,006 INFO L87 Difference]: Start difference. First operand 2390 states and 3024 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-01-10 04:10:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:39,118 INFO L93 Difference]: Finished difference Result 4995 states and 6468 transitions. [2022-01-10 04:10:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) Word has length 308 [2022-01-10 04:10:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:39,127 INFO L225 Difference]: With dead ends: 4995 [2022-01-10 04:10:39,127 INFO L226 Difference]: Without dead ends: 2642 [2022-01-10 04:10:39,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:39,130 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 39 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:39,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 255 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-01-10 04:10:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2636. [2022-01-10 04:10:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.252371916508539) internal successors, (3300), 2635 states have internal predecessors, (3300), 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) [2022-01-10 04:10:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3300 transitions. [2022-01-10 04:10:39,168 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3300 transitions. Word has length 308 [2022-01-10 04:10:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:39,168 INFO L470 AbstractCegarLoop]: Abstraction has 2636 states and 3300 transitions. [2022-01-10 04:10:39,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-01-10 04:10:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3300 transitions. [2022-01-10 04:10:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-01-10 04:10:39,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:39,173 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:39,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:39,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:39,381 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -408134844, now seen corresponding path program 1 times [2022-01-10 04:10:39,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:39,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106232610] [2022-01-10 04:10:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:39,382 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:39,383 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:39,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 04:10:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:39,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:39,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-01-10 04:10:39,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:39,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:39,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106232610] [2022-01-10 04:10:39,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106232610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:39,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:39,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:39,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374959270] [2022-01-10 04:10:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:39,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:39,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:39,876 INFO L87 Difference]: Start difference. First operand 2636 states and 3300 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2022-01-10 04:10:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:39,903 INFO L93 Difference]: Finished difference Result 7570 states and 9494 transitions. [2022-01-10 04:10:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) Word has length 309 [2022-01-10 04:10:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:39,913 INFO L225 Difference]: With dead ends: 7570 [2022-01-10 04:10:39,913 INFO L226 Difference]: Without dead ends: 4971 [2022-01-10 04:10:39,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:39,916 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 85 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:39,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 408 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4971 states. [2022-01-10 04:10:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4971 to 4969. [2022-01-10 04:10:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 1.2530193236714975) internal successors, (6225), 4968 states have internal predecessors, (6225), 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) [2022-01-10 04:10:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 6225 transitions. [2022-01-10 04:10:39,971 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 6225 transitions. Word has length 309 [2022-01-10 04:10:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:39,972 INFO L470 AbstractCegarLoop]: Abstraction has 4969 states and 6225 transitions. [2022-01-10 04:10:39,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2022-01-10 04:10:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 6225 transitions. [2022-01-10 04:10:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-01-10 04:10:39,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:39,976 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:39,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:40,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:40,183 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 722980357, now seen corresponding path program 1 times [2022-01-10 04:10:40,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171497991] [2022-01-10 04:10:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:40,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:40,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:40,186 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:40,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 04:10:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:40,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 04:10:40,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 04:10:40,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:10:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 04:10:41,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:41,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171497991] [2022-01-10 04:10:41,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171497991] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:10:41,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:10:41,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 04:10:41,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889534057] [2022-01-10 04:10:41,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:10:41,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:10:41,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:10:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:10:41,047 INFO L87 Difference]: Start difference. First operand 4969 states and 6225 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2022-01-10 04:10:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:41,529 INFO L93 Difference]: Finished difference Result 13492 states and 17018 transitions. [2022-01-10 04:10:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 04:10:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) Word has length 347 [2022-01-10 04:10:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:41,545 INFO L225 Difference]: With dead ends: 13492 [2022-01-10 04:10:41,545 INFO L226 Difference]: Without dead ends: 8560 [2022-01-10 04:10:41,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 04:10:41,550 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 441 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:41,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 858 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 04:10:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2022-01-10 04:10:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 5629. [2022-01-10 04:10:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5629 states, 5628 states have (on average 1.2759417199715708) internal successors, (7181), 5628 states have internal predecessors, (7181), 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) [2022-01-10 04:10:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 7181 transitions. [2022-01-10 04:10:41,622 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 7181 transitions. Word has length 347 [2022-01-10 04:10:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:41,622 INFO L470 AbstractCegarLoop]: Abstraction has 5629 states and 7181 transitions. [2022-01-10 04:10:41,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2022-01-10 04:10:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 7181 transitions. [2022-01-10 04:10:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2022-01-10 04:10:41,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:41,627 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:41,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:41,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:41,835 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1271402836, now seen corresponding path program 1 times [2022-01-10 04:10:41,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:41,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536086174] [2022-01-10 04:10:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:41,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:41,853 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:41,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 04:10:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:41,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:41,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2022-01-10 04:10:42,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:42,261 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:42,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536086174] [2022-01-10 04:10:42,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536086174] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:42,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:42,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:42,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735685585] [2022-01-10 04:10:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:42,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:42,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:42,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:42,262 INFO L87 Difference]: Start difference. First operand 5629 states and 7181 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2022-01-10 04:10:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:42,395 INFO L93 Difference]: Finished difference Result 10929 states and 14091 transitions. [2022-01-10 04:10:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) Word has length 386 [2022-01-10 04:10:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:42,407 INFO L225 Difference]: With dead ends: 10929 [2022-01-10 04:10:42,407 INFO L226 Difference]: Without dead ends: 2760 [2022-01-10 04:10:42,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:42,413 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:42,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2022-01-10 04:10:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2619. [2022-01-10 04:10:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 2618 states have (on average 1.2425515660809778) internal successors, (3253), 2618 states have internal predecessors, (3253), 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) [2022-01-10 04:10:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3253 transitions. [2022-01-10 04:10:42,445 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3253 transitions. Word has length 386 [2022-01-10 04:10:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:42,445 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3253 transitions. [2022-01-10 04:10:42,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2022-01-10 04:10:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3253 transitions. [2022-01-10 04:10:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2022-01-10 04:10:42,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:42,449 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:42,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-01-10 04:10:42,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:42,658 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash -912634457, now seen corresponding path program 1 times [2022-01-10 04:10:42,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789516453] [2022-01-10 04:10:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:42,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:42,660 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:42,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 04:10:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:42,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 04:10:42,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 1576 proven. 14 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2022-01-10 04:10:43,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:10:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 1576 proven. 14 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2022-01-10 04:10:43,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789516453] [2022-01-10 04:10:43,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789516453] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:10:43,441 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:10:43,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 04:10:43,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71323480] [2022-01-10 04:10:43,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:10:43,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:10:43,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:10:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:10:43,443 INFO L87 Difference]: Start difference. First operand 2619 states and 3253 transitions. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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) [2022-01-10 04:10:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:43,586 INFO L93 Difference]: Finished difference Result 2854 states and 3551 transitions. [2022-01-10 04:10:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 04:10:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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) Word has length 498 [2022-01-10 04:10:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:43,587 INFO L225 Difference]: With dead ends: 2854 [2022-01-10 04:10:43,587 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 04:10:43,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 04:10:43,589 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 123 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:43,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 261 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 04:10:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 04:10:43,590 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) [2022-01-10 04:10:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 04:10:43,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 498 [2022-01-10 04:10:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:43,590 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 04:10:43,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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) [2022-01-10 04:10:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 04:10:43,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 04:10:43,592 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 04:10:43,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-01-10 04:10:43,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:43,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 04:10:45,649 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 306) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 530) the Hoare annotation is: (let ((.cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse2 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) .cse0 .cse1) (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse0) (and .cse2 .cse0 .cse1) (and .cse2 .cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 468) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 272) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 528) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 539) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 550) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 305) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 240) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L303-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L854 garLoopResultBuilder]: At program point L171(lines 167 540) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 111) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 504) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-01-10 04:10:45,650 INFO L858 garLoopResultBuilder]: For program point L502-2(lines 502 504) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L469-2(lines 469 473) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L370-2(lines 370 374) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 527) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 538) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 549) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 341) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L339-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 528) the Hoare annotation is: (let ((.cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse2 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) .cse0 .cse1) (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse0) (and .cse2 .cse0 .cse1) (and .cse2 .cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,651 INFO L854 garLoopResultBuilder]: At program point L141(lines 137 550) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32)))) [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L108-2(lines 105 111) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 441) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 408) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 526) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 537) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 548) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 508 510) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-01-10 04:10:45,651 INFO L858 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L861 garLoopResultBuilder]: At program point L575(lines 118 576) the Hoare annotation is: true [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 525) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 536) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 547) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 526) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32)) (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0) (and (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (let ((.cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))) (and (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4560 32)) .cse1)))))) [2022-01-10 04:10:45,652 INFO L854 garLoopResultBuilder]: At program point L147(lines 143 548) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv1 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32)))) [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 116) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 263) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L247-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 491) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 460) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 460) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L479-2(lines 479 491) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 350) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 524) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 535) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 546) no Hoare annotation was computed. [2022-01-10 04:10:45,652 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 515) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 524) the Hoare annotation is: (let ((.cse0 (= (_ bv4352 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32)) (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0))) [2022-01-10 04:10:45,653 INFO L854 garLoopResultBuilder]: At program point L183(lines 173 538) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 582) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 384) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 523) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 534) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 545) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 96 586) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 456) no Hoare annotation was computed. [2022-01-10 04:10:45,653 INFO L861 garLoopResultBuilder]: At program point L219(lines 218 523) the Hoare annotation is: true [2022-01-10 04:10:45,653 INFO L854 garLoopResultBuilder]: At program point L153(lines 149 546) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))) (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L485(lines 485 488) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L861 garLoopResultBuilder]: At program point L221(lines 220 523) the Hoare annotation is: true [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 533) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 544) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 555) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L861 garLoopResultBuilder]: At program point L585(lines 22 587) the Hoare annotation is: true [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 331) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 321 331) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 534) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,654 INFO L854 garLoopResultBuilder]: At program point L123(lines 122 555) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv12292 32))) [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 357) no Hoare annotation was computed. [2022-01-10 04:10:45,654 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L854 garLoopResultBuilder]: At program point L521(lines 119 574) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4560 32))) (.cse1 (= (_ bv4352 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4560 32))) (.cse5 (= (_ bv4528 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse10 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4416 32))) (.cse15 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4496 32))) (.cse7 (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse14 (= (_ bv4512 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4448 32))) (.cse13 (= (_ bv4432 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv3 32))) (.cse12 (= (_ bv4464 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse9 (= (_ bv4480 32) |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|))) (or (and (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3) (and .cse8 .cse3 .cse6) (and .cse3 .cse9 .cse6) (and .cse3 .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (and .cse10 .cse3 (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (and .cse7 .cse3 .cse5) (and .cse11 .cse6) (and .cse7 .cse3 .cse12) (and .cse7 .cse3 .cse13) (and .cse2 .cse3 .cse1) (and .cse7 .cse3 .cse9) (and .cse14 .cse0) (and .cse3 .cse15 .cse6) (and .cse3 .cse15 .cse0) (and .cse4 .cse0) (and .cse5 .cse0) (and .cse3 .cse14 .cse6) (and .cse10 .cse3 .cse0) (and .cse3 .cse0 .cse12) (and .cse7 .cse3 .cse15) (and .cse7 .cse3 .cse14) (and .cse8 .cse3 .cse0) (and .cse3 .cse0 .cse13) (and .cse3 .cse11 .cse0) (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4368 32))) (and .cse3 .cse12 .cse6) (and .cse3 .cse9 .cse0) (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv1 32)) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L854 garLoopResultBuilder]: At program point L356(lines 96 586) the Hoare annotation is: false [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L422-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 532) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 543) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 554) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 261) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L854 garLoopResultBuilder]: At program point L159(lines 155 544) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and .cse0 (= (_ bv3 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)))) [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 572) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 393) no Hoare annotation was computed. [2022-01-10 04:10:45,655 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2022-01-10 04:10:45,656 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 327) no Hoare annotation was computed. [2022-01-10 04:10:45,656 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2022-01-10 04:10:45,656 INFO L858 garLoopResultBuilder]: For program point L325-2(lines 323 331) no Hoare annotation was computed. [2022-01-10 04:10:45,656 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 04:10:45,657 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 571) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L854 garLoopResultBuilder]: At program point L227(lines 125 554) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4400 32))) (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32)))) [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 531) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 542) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 553) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 563) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L558-2(lines 557 571) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 532) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| (_ bv4384 32)))))) [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 400) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 530) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 541) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 552) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 584) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L854 garLoopResultBuilder]: At program point L165(lines 161 542) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| (_ bv4384 32))))) (or (and (= (_ bv4 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= (_ bv2 32) |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)))) [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 496 498) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 232 234) no Hoare annotation was computed. [2022-01-10 04:10:45,658 INFO L861 garLoopResultBuilder]: At program point L596(lines 588 598) the Hoare annotation is: true [2022-01-10 04:10:45,658 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 434) no Hoare annotation was computed. [2022-01-10 04:10:45,659 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 529) no Hoare annotation was computed. [2022-01-10 04:10:45,659 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 540) no Hoare annotation was computed. [2022-01-10 04:10:45,659 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 551) no Hoare annotation was computed. [2022-01-10 04:10:45,662 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:45,663 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 04:10:45,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:10:45 BoogieIcfgContainer [2022-01-10 04:10:45,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 04:10:45,689 INFO L158 Benchmark]: Toolchain (without parser) took 18868.14ms. Allocated memory was 187.7MB in the beginning and 374.3MB in the end (delta: 186.6MB). Free memory was 132.9MB in the beginning and 330.1MB in the end (delta: -197.2MB). Peak memory consumption was 208.0MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,689 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:10:45,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.60ms. Allocated memory was 187.7MB in the beginning and 259.0MB in the end (delta: 71.3MB). Free memory was 132.7MB in the beginning and 227.1MB in the end (delta: -94.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.23ms. Allocated memory is still 259.0MB. Free memory was 227.1MB in the beginning and 224.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,689 INFO L158 Benchmark]: Boogie Preprocessor took 23.66ms. Allocated memory is still 259.0MB. Free memory was 224.5MB in the beginning and 222.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,690 INFO L158 Benchmark]: RCFGBuilder took 536.71ms. Allocated memory is still 259.0MB. Free memory was 222.4MB in the beginning and 196.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,690 INFO L158 Benchmark]: TraceAbstraction took 18042.92ms. Allocated memory was 259.0MB in the beginning and 374.3MB in the end (delta: 115.3MB). Free memory was 196.2MB in the beginning and 330.1MB in the end (delta: -134.0MB). Peak memory consumption was 199.8MB. Max. memory is 8.0GB. [2022-01-10 04:10:45,691 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.60ms. Allocated memory was 187.7MB in the beginning and 259.0MB in the end (delta: 71.3MB). Free memory was 132.7MB in the beginning and 227.1MB in the end (delta: -94.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.23ms. Allocated memory is still 259.0MB. Free memory was 227.1MB in the beginning and 224.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.66ms. Allocated memory is still 259.0MB. Free memory was 224.5MB in the beginning and 222.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 536.71ms. Allocated memory is still 259.0MB. Free memory was 222.4MB in the beginning and 196.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18042.92ms. Allocated memory was 259.0MB in the beginning and 374.3MB in the end (delta: 115.3MB). Free memory was 196.2MB in the beginning and 330.1MB in the end (delta: -134.0MB). Peak memory consumption was 199.8MB. 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: 584]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 24, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1403 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1403 mSDsluCounter, 7781 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3096 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2657 IncrementalHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 4685 mSDtfsCounter, 2657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5309 GetRequests, 5273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5629occurred in iteration=22, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 3172 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 165 NumberOfFragments, 694 HoareAnnotationTreeSize, 22 FomulaSimplifications, 1121 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 3229 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 4478 NumberOfCodeBlocks, 4478 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5297 ConstructedInterpolants, 0 QuantifiedInterpolants, 6904 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5771 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 18796/18848 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: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((3bv32 == s__s3__tmp__next_state___0 && 2bv32 == blastFlag) && 4352bv32 == s__state) || ((s__s3__tmp__next_state___0 == 4560bv32 && 0bv32 == s__hit) && 4352bv32 == s__state) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((!(s__state == 4400bv32) && !(s__state == 4384bv32)) && 2bv32 == blastFlag) || ((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32))) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && s__state == 12292bv32 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((0bv32 == s__hit && 3bv32 == blastFlag) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((3bv32 == s__s3__tmp__next_state___0 && 2bv32 == blastFlag) && 4352bv32 == s__state) || ((s__s3__tmp__next_state___0 == 4560bv32 && 0bv32 == s__hit) && s__state == 4560bv32)) || ((0bv32 == s__hit && 4528bv32 == s__state) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((4bv32 == blastFlag && s__state == 4448bv32) && 0bv32 == s__hit)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((0bv32 == s__hit && 2bv32 == blastFlag) && s__state == 4400bv32)) || ((s__state == 4416bv32 && 0bv32 == s__hit) && 3bv32 == blastFlag)) || ((4bv32 == blastFlag && 0bv32 == s__hit) && 4528bv32 == s__state)) || (s__state == 3bv32 && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((4bv32 == blastFlag && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((4bv32 == blastFlag && 0bv32 == s__hit) && 4432bv32 == s__state)) || ((s__s3__tmp__next_state___0 == 4560bv32 && 0bv32 == s__hit) && 4352bv32 == s__state)) || ((4bv32 == blastFlag && 0bv32 == s__hit) && 4480bv32 == s__state)) || (4512bv32 == s__state && 2bv32 == blastFlag)) || ((0bv32 == s__hit && s__state == 4496bv32) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && 2bv32 == blastFlag)) || (s__state == 4560bv32 && 2bv32 == blastFlag)) || (4528bv32 == s__state && 2bv32 == blastFlag)) || ((0bv32 == s__hit && 4512bv32 == s__state) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && 2bv32 == blastFlag) && 4464bv32 == s__state)) || ((4bv32 == blastFlag && 0bv32 == s__hit) && s__state == 4496bv32)) || ((4bv32 == blastFlag && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && 2bv32 == blastFlag) && 4432bv32 == s__state)) || ((0bv32 == s__hit && s__state == 3bv32) && 2bv32 == blastFlag)) || (blastFlag == 0bv32 && s__state == 4368bv32)) || ((0bv32 == s__hit && 4464bv32 == s__state) && !(s__s3__tmp__next_state___0 == 4384bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && 2bv32 == blastFlag)) || (blastFlag == 1bv32 && s__state == 4384bv32) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 == 4560bv32 && 0bv32 == s__hit) && !(s__state == 4384bv32)) || (!(s__state == 4400bv32) && (((!(s__state == 4384bv32) && 2bv32 == blastFlag) && !(s__s3__tmp__next_state___0 == 4384bv32)) || (s__state == 4560bv32 && 2bv32 == blastFlag))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && !(s__state == 4400bv32)) && !(s__state == 4384bv32) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && !(s__state == 4400bv32)) && !(s__state == 4384bv32) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((!(s__state == 4400bv32) && !(s__state == 4384bv32)) && 2bv32 == blastFlag) || ((4bv32 == blastFlag && 0bv32 == s__hit) && !(s__state == 4384bv32))) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && 2bv32 == blastFlag)) || ((0bv32 == s__hit && !(s__state == 4384bv32)) && !(s__s3__tmp__next_state___0 == 4384bv32)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: blastFlag == 1bv32 && !(s__state == 4400bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 04:10:45,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...