./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:28:02,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:28:02,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:28:02,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:28:02,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:28:02,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:28:02,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:28:02,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:28:02,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:28:02,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:28:02,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:28:02,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:28:02,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:28:02,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:28:02,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:28:02,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:28:02,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:28:02,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:28:02,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:28:02,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:28:02,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:28:02,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:28:02,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:28:02,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:28:02,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:28:02,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:28:02,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:28:02,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:28:02,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:28:02,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:28:02,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:28:02,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:28:02,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:28:02,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:28:02,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:28:02,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:28:02,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:28:02,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:28:02,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:28:02,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:28:02,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:28:02,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:28:02,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:28:02,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:28:02,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:28:02,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:28:02,780 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:28:02,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:28:02,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:28:02,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:28:02,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:28:02,782 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:28:02,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:28:02,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:28:02,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:28:02,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:28:02,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:28:02,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:28:02,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:28:02,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:28:02,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:28:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:28:02,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:28:02,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:28:02,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:28:02,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:28:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:28:02,786 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:28:02,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:28:02,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:28:02,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-13 15:28:02,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:28:02,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:28:02,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:28:02,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:28:02,982 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:28:02,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-13 15:28:03,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab90835de/ea3a0864c7a548da8694ccecb9dcf612/FLAG1d909e3f9 [2022-07-13 15:28:03,435 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:28:03,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-13 15:28:03,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab90835de/ea3a0864c7a548da8694ccecb9dcf612/FLAG1d909e3f9 [2022-07-13 15:28:03,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab90835de/ea3a0864c7a548da8694ccecb9dcf612 [2022-07-13 15:28:03,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:28:03,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:28:03,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:28:03,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:28:03,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:28:03,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9af234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03, skipping insertion in model container [2022-07-13 15:28:03,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:28:03,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:28:03,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-13 15:28:03,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:28:03,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:28:03,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-13 15:28:03,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:28:03,837 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:28:03,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03 WrapperNode [2022-07-13 15:28:03,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:28:03,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:28:03,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:28:03,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:28:03,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,897 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2022-07-13 15:28:03,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:28:03,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:28:03,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:28:03,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:28:03,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:28:03,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:28:03,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:28:03,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:28:03,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (1/1) ... [2022-07-13 15:28:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:28:04,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:28:04,021 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-07-13 15:28:04,041 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-07-13 15:28:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:28:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:28:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:28:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:28:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:28:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:28:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:28:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:28:04,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:28:04,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:28:04,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:28:04,220 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 15:28:06,865 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 15:28:06,865 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 15:28:06,866 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:28:06,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:28:06,874 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 15:28:06,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:28:06 BoogieIcfgContainer [2022-07-13 15:28:06,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:28:06,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:28:06,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:28:06,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:28:06,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:28:03" (1/3) ... [2022-07-13 15:28:06,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5f86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:28:06, skipping insertion in model container [2022-07-13 15:28:06,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:28:03" (2/3) ... [2022-07-13 15:28:06,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5f86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:28:06, skipping insertion in model container [2022-07-13 15:28:06,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:28:06" (3/3) ... [2022-07-13 15:28:06,882 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-13 15:28:06,892 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:28:06,892 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:28:06,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:28:06,951 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b886204, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7331c9a8 [2022-07-13 15:28:06,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:28:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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-07-13 15:28:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:28:06,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:06,962 INFO L195 NwaCegarLoop]: 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-07-13 15:28:06,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-13 15:28:06,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:06,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291702215] [2022-07-13 15:28:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291702215] [2022-07-13 15:28:07,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291702215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:07,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:07,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:28:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047261181] [2022-07-13 15:28:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:07,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:28:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:28:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:28:07,439 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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-07-13 15:28:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:07,523 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-13 15:28:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:28:07,526 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-07-13 15:28:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:07,535 INFO L225 Difference]: With dead ends: 375 [2022-07-13 15:28:07,535 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 15:28:07,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-13 15:28:07,545 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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-07-13 15:28:07,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:28:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 15:28:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-13 15:28:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 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-07-13 15:28:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-13 15:28:07,600 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-13 15:28:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:07,600 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-13 15:28:07,601 INFO L496 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-07-13 15:28:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-13 15:28:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:28:07,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:07,603 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 15:28:07,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:28:07,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-13 15:28:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:07,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923188492] [2022-07-13 15:28:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:07,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923188492] [2022-07-13 15:28:07,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923188492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:07,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:07,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940624405] [2022-07-13 15:28:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:07,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:07,907 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-07-13 15:28:09,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:10,293 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2022-07-13 15:28:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:10,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2022-07-13 15:28:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:10,297 INFO L225 Difference]: With dead ends: 612 [2022-07-13 15:28:10,297 INFO L226 Difference]: Without dead ends: 402 [2022-07-13 15:28:10,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:10,299 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 271 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:28:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-13 15:28:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-13 15:28:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 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-07-13 15:28:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2022-07-13 15:28:10,341 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2022-07-13 15:28:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:10,342 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2022-07-13 15:28:10,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-07-13 15:28:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2022-07-13 15:28:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:28:10,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:10,346 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 15:28:10,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:28:10,347 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2022-07-13 15:28:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:10,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108928241] [2022-07-13 15:28:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:10,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108928241] [2022-07-13 15:28:10,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108928241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:10,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:10,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182693450] [2022-07-13 15:28:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:10,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:10,509 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-07-13 15:28:12,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:14,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:14,742 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2022-07-13 15:28:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:14,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-07-13 15:28:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:14,744 INFO L225 Difference]: With dead ends: 431 [2022-07-13 15:28:14,744 INFO L226 Difference]: Without dead ends: 300 [2022-07-13 15:28:14,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:14,746 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:14,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 476 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-13 15:28:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2022-07-13 15:28:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 282 states have internal predecessors, (435), 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-07-13 15:28:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-07-13 15:28:14,761 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2022-07-13 15:28:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:14,762 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-07-13 15:28:14,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-07-13 15:28:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-07-13 15:28:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 15:28:14,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:14,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-13 15:28:14,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:28:14,769 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2022-07-13 15:28:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:14,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237951189] [2022-07-13 15:28:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:14,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:14,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237951189] [2022-07-13 15:28:14,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237951189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:14,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:14,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491791843] [2022-07-13 15:28:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:14,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:14,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:14,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:14,907 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-07-13 15:28:16,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:18,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:19,167 INFO L93 Difference]: Finished difference Result 758 states and 1164 transitions. [2022-07-13 15:28:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2022-07-13 15:28:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:19,169 INFO L225 Difference]: With dead ends: 758 [2022-07-13 15:28:19,169 INFO L226 Difference]: Without dead ends: 482 [2022-07-13 15:28:19,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:19,170 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 113 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:19,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 501 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-13 15:28:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 308. [2022-07-13 15:28:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.52442996742671) internal successors, (468), 307 states have internal predecessors, (468), 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-07-13 15:28:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 468 transitions. [2022-07-13 15:28:19,179 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 468 transitions. Word has length 55 [2022-07-13 15:28:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:19,180 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 468 transitions. [2022-07-13 15:28:19,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-07-13 15:28:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 468 transitions. [2022-07-13 15:28:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 15:28:19,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:19,181 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2022-07-13 15:28:19,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:28:19,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2022-07-13 15:28:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:19,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92541744] [2022-07-13 15:28:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92541744] [2022-07-13 15:28:19,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92541744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:19,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:19,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652755395] [2022-07-13 15:28:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:19,293 INFO L87 Difference]: Start difference. First operand 308 states and 468 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-07-13 15:28:21,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:23,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:23,456 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2022-07-13 15:28:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2022-07-13 15:28:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:23,458 INFO L225 Difference]: With dead ends: 484 [2022-07-13 15:28:23,458 INFO L226 Difference]: Without dead ends: 324 [2022-07-13 15:28:23,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:23,459 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:23,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 474 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-07-13 15:28:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-13 15:28:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2022-07-13 15:28:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 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-07-13 15:28:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2022-07-13 15:28:23,469 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 55 [2022-07-13 15:28:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:23,470 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2022-07-13 15:28:23,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-07-13 15:28:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2022-07-13 15:28:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 15:28:23,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:23,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-07-13 15:28:23,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:28:23,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2022-07-13 15:28:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:23,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025411684] [2022-07-13 15:28:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025411684] [2022-07-13 15:28:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025411684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:23,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:23,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590128698] [2022-07-13 15:28:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:23,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:23,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:23,618 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-07-13 15:28:25,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:25,899 INFO L93 Difference]: Finished difference Result 768 states and 1162 transitions. [2022-07-13 15:28:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-07-13 15:28:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:25,901 INFO L225 Difference]: With dead ends: 768 [2022-07-13 15:28:25,901 INFO L226 Difference]: Without dead ends: 470 [2022-07-13 15:28:25,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:25,902 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:25,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:28:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-13 15:28:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 312. [2022-07-13 15:28:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 311 states have internal predecessors, (470), 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-07-13 15:28:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2022-07-13 15:28:25,911 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 56 [2022-07-13 15:28:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:25,911 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2022-07-13 15:28:25,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-07-13 15:28:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2022-07-13 15:28:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 15:28:25,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:25,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-07-13 15:28:25,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:28:25,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2022-07-13 15:28:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:25,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247899762] [2022-07-13 15:28:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:25,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247899762] [2022-07-13 15:28:25,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247899762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:25,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:25,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211212685] [2022-07-13 15:28:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:25,997 INFO L87 Difference]: Start difference. First operand 312 states and 470 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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-07-13 15:28:28,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:30,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:30,252 INFO L93 Difference]: Finished difference Result 490 states and 737 transitions. [2022-07-13 15:28:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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 57 [2022-07-13 15:28:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:30,254 INFO L225 Difference]: With dead ends: 490 [2022-07-13 15:28:30,254 INFO L226 Difference]: Without dead ends: 328 [2022-07-13 15:28:30,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:30,255 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:30,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 470 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-13 15:28:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-07-13 15:28:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5080385852090032) internal successors, (469), 311 states have internal predecessors, (469), 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-07-13 15:28:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 469 transitions. [2022-07-13 15:28:30,262 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 469 transitions. Word has length 57 [2022-07-13 15:28:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:30,263 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 469 transitions. [2022-07-13 15:28:30,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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-07-13 15:28:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 469 transitions. [2022-07-13 15:28:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 15:28:30,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:30,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-07-13 15:28:30,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:28:30,265 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2022-07-13 15:28:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:30,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952952477] [2022-07-13 15:28:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:30,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952952477] [2022-07-13 15:28:30,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952952477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:30,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:30,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:30,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901393477] [2022-07-13 15:28:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:30,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:30,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:30,383 INFO L87 Difference]: Start difference. First operand 312 states and 469 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07-13 15:28:32,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:32,642 INFO L93 Difference]: Finished difference Result 772 states and 1158 transitions. [2022-07-13 15:28:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2022-07-13 15:28:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:32,644 INFO L225 Difference]: With dead ends: 772 [2022-07-13 15:28:32,644 INFO L226 Difference]: Without dead ends: 470 [2022-07-13 15:28:32,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:32,645 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:32,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 15:28:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-13 15:28:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-07-13 15:28:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4984126984126984) internal successors, (472), 315 states have internal predecessors, (472), 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-07-13 15:28:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2022-07-13 15:28:32,652 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 58 [2022-07-13 15:28:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:32,653 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2022-07-13 15:28:32,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07-13 15:28:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2022-07-13 15:28:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 15:28:32,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:32,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 15:28:32,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:28:32,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2022-07-13 15:28:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:32,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795696330] [2022-07-13 15:28:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 15:28:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795696330] [2022-07-13 15:28:32,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795696330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:32,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:32,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:28:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312375365] [2022-07-13 15:28:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:28:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:28:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:28:32,749 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-07-13 15:28:34,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:34,790 INFO L93 Difference]: Finished difference Result 641 states and 962 transitions. [2022-07-13 15:28:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:28:34,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 58 [2022-07-13 15:28:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:34,791 INFO L225 Difference]: With dead ends: 641 [2022-07-13 15:28:34,792 INFO L226 Difference]: Without dead ends: 477 [2022-07-13 15:28:34,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-13 15:28:34,792 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:34,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 15:28:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-13 15:28:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-07-13 15:28:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4915966386554622) internal successors, (710), 476 states have internal predecessors, (710), 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-07-13 15:28:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 710 transitions. [2022-07-13 15:28:34,800 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 710 transitions. Word has length 58 [2022-07-13 15:28:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:34,800 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 710 transitions. [2022-07-13 15:28:34,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-07-13 15:28:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 710 transitions. [2022-07-13 15:28:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 15:28:34,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:34,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 15:28:34,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:28:34,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2022-07-13 15:28:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:34,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557035654] [2022-07-13 15:28:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:28:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557035654] [2022-07-13 15:28:34,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557035654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:34,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:34,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:28:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562951757] [2022-07-13 15:28:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:28:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:34,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:28:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:28:34,895 INFO L87 Difference]: Start difference. First operand 477 states and 710 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-07-13 15:28:36,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:36,942 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2022-07-13 15:28:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:28:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2022-07-13 15:28:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:36,944 INFO L225 Difference]: With dead ends: 826 [2022-07-13 15:28:36,944 INFO L226 Difference]: Without dead ends: 501 [2022-07-13 15:28:36,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-13 15:28:36,945 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:36,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 354 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 15:28:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-13 15:28:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-07-13 15:28:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.484) internal successors, (742), 500 states have internal predecessors, (742), 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-07-13 15:28:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 742 transitions. [2022-07-13 15:28:36,954 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 742 transitions. Word has length 58 [2022-07-13 15:28:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:36,954 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 742 transitions. [2022-07-13 15:28:36,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-07-13 15:28:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 742 transitions. [2022-07-13 15:28:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 15:28:36,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:36,957 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 15:28:36,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:28:36,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2022-07-13 15:28:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:36,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939719531] [2022-07-13 15:28:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 15:28:37,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:37,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939719531] [2022-07-13 15:28:37,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939719531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:37,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:37,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423205932] [2022-07-13 15:28:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:37,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:37,059 INFO L87 Difference]: Start difference. First operand 501 states and 742 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-07-13 15:28:39,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:39,372 INFO L93 Difference]: Finished difference Result 1297 states and 1926 transitions. [2022-07-13 15:28:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:39,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 78 [2022-07-13 15:28:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:39,376 INFO L225 Difference]: With dead ends: 1297 [2022-07-13 15:28:39,376 INFO L226 Difference]: Without dead ends: 806 [2022-07-13 15:28:39,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:39,378 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:39,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:28:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-13 15:28:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 579. [2022-07-13 15:28:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4965397923875432) internal successors, (865), 578 states have internal predecessors, (865), 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-07-13 15:28:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2022-07-13 15:28:39,394 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 78 [2022-07-13 15:28:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:39,395 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2022-07-13 15:28:39,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-07-13 15:28:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2022-07-13 15:28:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 15:28:39,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:39,399 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 15:28:39,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 15:28:39,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2022-07-13 15:28:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:39,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349966313] [2022-07-13 15:28:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:39,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349966313] [2022-07-13 15:28:39,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349966313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:39,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:39,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981306605] [2022-07-13 15:28:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:39,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:39,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:39,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:39,555 INFO L87 Difference]: Start difference. First operand 579 states and 865 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-07-13 15:28:41,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:41,827 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2022-07-13 15:28:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 78 [2022-07-13 15:28:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:41,834 INFO L225 Difference]: With dead ends: 1363 [2022-07-13 15:28:41,834 INFO L226 Difference]: Without dead ends: 794 [2022-07-13 15:28:41,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:41,835 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:41,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 15:28:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-13 15:28:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 594. [2022-07-13 15:28:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 593 states have internal predecessors, (892), 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-07-13 15:28:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 892 transitions. [2022-07-13 15:28:41,846 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 892 transitions. Word has length 78 [2022-07-13 15:28:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:41,847 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 892 transitions. [2022-07-13 15:28:41,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-07-13 15:28:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 892 transitions. [2022-07-13 15:28:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 15:28:41,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:41,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 15:28:41,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 15:28:41,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1728932100, now seen corresponding path program 1 times [2022-07-13 15:28:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:41,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85635456] [2022-07-13 15:28:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:41,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85635456] [2022-07-13 15:28:41,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85635456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876406859] [2022-07-13 15:28:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:41,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:41,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:41,942 INFO L87 Difference]: Start difference. First operand 594 states and 892 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-07-13 15:28:43,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:44,176 INFO L93 Difference]: Finished difference Result 1453 states and 2163 transitions. [2022-07-13 15:28:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 79 [2022-07-13 15:28:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:44,178 INFO L225 Difference]: With dead ends: 1453 [2022-07-13 15:28:44,178 INFO L226 Difference]: Without dead ends: 869 [2022-07-13 15:28:44,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:44,180 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:44,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 15:28:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-13 15:28:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 672. [2022-07-13 15:28:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.5081967213114753) internal successors, (1012), 671 states have internal predecessors, (1012), 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-07-13 15:28:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1012 transitions. [2022-07-13 15:28:44,198 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1012 transitions. Word has length 79 [2022-07-13 15:28:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:44,198 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1012 transitions. [2022-07-13 15:28:44,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-07-13 15:28:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1012 transitions. [2022-07-13 15:28:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 15:28:44,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:44,200 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 15:28:44,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:28:44,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2061764687, now seen corresponding path program 1 times [2022-07-13 15:28:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650722657] [2022-07-13 15:28:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650722657] [2022-07-13 15:28:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650722657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:44,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:44,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265783464] [2022-07-13 15:28:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:44,330 INFO L87 Difference]: Start difference. First operand 672 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-07-13 15:28:46,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:48,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:48,536 INFO L93 Difference]: Finished difference Result 1471 states and 2201 transitions. [2022-07-13 15:28:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 80 [2022-07-13 15:28:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:48,546 INFO L225 Difference]: With dead ends: 1471 [2022-07-13 15:28:48,547 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 15:28:48,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:48,548 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:48,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 496 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 15:28:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-13 15:28:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5115332428765265) internal successors, (1114), 737 states have internal predecessors, (1114), 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-07-13 15:28:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2022-07-13 15:28:48,562 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 80 [2022-07-13 15:28:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:48,562 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2022-07-13 15:28:48,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-07-13 15:28:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2022-07-13 15:28:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 15:28:48,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:48,564 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1] [2022-07-13 15:28:48,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:28:48,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash 793593224, now seen corresponding path program 1 times [2022-07-13 15:28:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:48,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427609257] [2022-07-13 15:28:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427609257] [2022-07-13 15:28:48,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427609257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:48,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:48,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602968551] [2022-07-13 15:28:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:48,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:48,678 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-07-13 15:28:50,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:52,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:52,874 INFO L93 Difference]: Finished difference Result 1537 states and 2300 transitions. [2022-07-13 15:28:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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 95 [2022-07-13 15:28:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:52,877 INFO L225 Difference]: With dead ends: 1537 [2022-07-13 15:28:52,877 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 15:28:52,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:52,879 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:52,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 15:28:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-13 15:28:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.507462686567164) internal successors, (1111), 737 states have internal predecessors, (1111), 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-07-13 15:28:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1111 transitions. [2022-07-13 15:28:52,895 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1111 transitions. Word has length 95 [2022-07-13 15:28:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:52,895 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1111 transitions. [2022-07-13 15:28:52,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-07-13 15:28:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1111 transitions. [2022-07-13 15:28:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 15:28:52,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:52,896 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2022-07-13 15:28:52,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 15:28:52,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:52,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1231158467, now seen corresponding path program 1 times [2022-07-13 15:28:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:52,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514338342] [2022-07-13 15:28:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514338342] [2022-07-13 15:28:53,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514338342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:53,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:53,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531956840] [2022-07-13 15:28:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:53,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:53,010 INFO L87 Difference]: Start difference. First operand 738 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-07-13 15:28:55,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:55,265 INFO L93 Difference]: Finished difference Result 1666 states and 2484 transitions. [2022-07-13 15:28:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 97 [2022-07-13 15:28:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:55,268 INFO L225 Difference]: With dead ends: 1666 [2022-07-13 15:28:55,268 INFO L226 Difference]: Without dead ends: 938 [2022-07-13 15:28:55,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:55,270 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:55,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 15:28:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-13 15:28:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 738. [2022-07-13 15:28:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4871099050203527) internal successors, (1096), 737 states have internal predecessors, (1096), 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-07-13 15:28:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1096 transitions. [2022-07-13 15:28:55,284 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1096 transitions. Word has length 97 [2022-07-13 15:28:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:55,284 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1096 transitions. [2022-07-13 15:28:55,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-07-13 15:28:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1096 transitions. [2022-07-13 15:28:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 15:28:55,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:55,286 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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-07-13 15:28:55,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 15:28:55,286 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1142724731, now seen corresponding path program 1 times [2022-07-13 15:28:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:55,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263996376] [2022-07-13 15:28:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:55,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:28:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:55,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263996376] [2022-07-13 15:28:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263996376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:55,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:55,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:28:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986734924] [2022-07-13 15:28:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:55,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:28:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:28:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:28:55,413 INFO L87 Difference]: Start difference. First operand 738 states and 1096 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07-13 15:28:57,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:59,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:28:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:28:59,608 INFO L93 Difference]: Finished difference Result 1510 states and 2231 transitions. [2022-07-13 15:28:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:28:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 98 [2022-07-13 15:28:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:28:59,611 INFO L225 Difference]: With dead ends: 1510 [2022-07-13 15:28:59,611 INFO L226 Difference]: Without dead ends: 782 [2022-07-13 15:28:59,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:28:59,613 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:28:59,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 15:28:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-13 15:28:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 738. [2022-07-13 15:28:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4830393487109905) internal successors, (1093), 737 states have internal predecessors, (1093), 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-07-13 15:28:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1093 transitions. [2022-07-13 15:28:59,630 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1093 transitions. Word has length 98 [2022-07-13 15:28:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:28:59,630 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1093 transitions. [2022-07-13 15:28:59,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07-13 15:28:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1093 transitions. [2022-07-13 15:28:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 15:28:59,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:28:59,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:28:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 15:28:59,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:28:59,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:28:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2022-07-13 15:28:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:28:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243067500] [2022-07-13 15:28:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:28:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:28:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:28:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:28:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:28:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243067500] [2022-07-13 15:28:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243067500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:28:59,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:28:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:28:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986769188] [2022-07-13 15:28:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:28:59,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:28:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:28:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:28:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:28:59,730 INFO L87 Difference]: Start difference. First operand 738 states and 1093 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-07-13 15:29:01,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:01,787 INFO L93 Difference]: Finished difference Result 1485 states and 2202 transitions. [2022-07-13 15:29:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:01,788 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 98 [2022-07-13 15:29:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:01,790 INFO L225 Difference]: With dead ends: 1485 [2022-07-13 15:29:01,790 INFO L226 Difference]: Without dead ends: 978 [2022-07-13 15:29:01,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-13 15:29:01,792 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:01,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 15:29:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-13 15:29:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2022-07-13 15:29:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.4820512820512821) internal successors, (1445), 975 states have internal predecessors, (1445), 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-07-13 15:29:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1445 transitions. [2022-07-13 15:29:01,807 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1445 transitions. Word has length 98 [2022-07-13 15:29:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:01,808 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1445 transitions. [2022-07-13 15:29:01,808 INFO L496 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-07-13 15:29:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1445 transitions. [2022-07-13 15:29:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 15:29:01,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:01,809 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:29:01,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 15:29:01,810 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2022-07-13 15:29:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:29:01,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999874626] [2022-07-13 15:29:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:29:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:29:01,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:29:01,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999874626] [2022-07-13 15:29:01,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999874626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:01,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:01,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310036051] [2022-07-13 15:29:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:01,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:29:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:01,890 INFO L87 Difference]: Start difference. First operand 976 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-07-13 15:29:03,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:03,936 INFO L93 Difference]: Finished difference Result 1695 states and 2507 transitions. [2022-07-13 15:29:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 98 [2022-07-13 15:29:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:03,939 INFO L225 Difference]: With dead ends: 1695 [2022-07-13 15:29:03,939 INFO L226 Difference]: Without dead ends: 950 [2022-07-13 15:29:03,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-13 15:29:03,941 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:03,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 472 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 15:29:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-13 15:29:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-13 15:29:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.4741833508956796) internal successors, (1399), 949 states have internal predecessors, (1399), 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-07-13 15:29:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1399 transitions. [2022-07-13 15:29:03,967 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1399 transitions. Word has length 98 [2022-07-13 15:29:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:03,967 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1399 transitions. [2022-07-13 15:29:03,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-07-13 15:29:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1399 transitions. [2022-07-13 15:29:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 15:29:03,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:03,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:29:03,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:29:03,969 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -741144714, now seen corresponding path program 1 times [2022-07-13 15:29:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:29:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47576868] [2022-07-13 15:29:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:29:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:29:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:29:04,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47576868] [2022-07-13 15:29:04,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47576868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:04,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:04,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:29:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177508860] [2022-07-13 15:29:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:04,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:29:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:29:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:29:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:29:04,072 INFO L87 Difference]: Start difference. First operand 950 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-07-13 15:29:06,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:06,349 INFO L93 Difference]: Finished difference Result 2150 states and 3137 transitions. [2022-07-13 15:29:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:29:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 101 [2022-07-13 15:29:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:06,353 INFO L225 Difference]: With dead ends: 2150 [2022-07-13 15:29:06,353 INFO L226 Difference]: Without dead ends: 1210 [2022-07-13 15:29:06,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:29:06,354 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:06,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 278 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:29:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-07-13 15:29:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 958. [2022-07-13 15:29:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4743991640543366) internal successors, (1411), 957 states have internal predecessors, (1411), 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-07-13 15:29:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1411 transitions. [2022-07-13 15:29:06,387 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1411 transitions. Word has length 101 [2022-07-13 15:29:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:06,387 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1411 transitions. [2022-07-13 15:29:06,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-07-13 15:29:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1411 transitions. [2022-07-13 15:29:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 15:29:06,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:06,389 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-13 15:29:06,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 15:29:06,389 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-13 15:29:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:29:06,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782397363] [2022-07-13 15:29:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:29:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-13 15:29:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:29:06,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782397363] [2022-07-13 15:29:06,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782397363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:06,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:06,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:29:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874544902] [2022-07-13 15:29:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:06,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:29:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:29:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:29:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:29:06,586 INFO L87 Difference]: Start difference. First operand 958 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07-13 15:29:08,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:08,760 INFO L93 Difference]: Finished difference Result 1907 states and 2808 transitions. [2022-07-13 15:29:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:29:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 122 [2022-07-13 15:29:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:08,763 INFO L225 Difference]: With dead ends: 1907 [2022-07-13 15:29:08,764 INFO L226 Difference]: Without dead ends: 959 [2022-07-13 15:29:08,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:29:08,765 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:08,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 15:29:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-13 15:29:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-07-13 15:29:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4733542319749215) internal successors, (1410), 957 states have internal predecessors, (1410), 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-07-13 15:29:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1410 transitions. [2022-07-13 15:29:08,789 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1410 transitions. Word has length 122 [2022-07-13 15:29:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:08,790 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1410 transitions. [2022-07-13 15:29:08,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07-13 15:29:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1410 transitions. [2022-07-13 15:29:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 15:29:08,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:08,792 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-07-13 15:29:08,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 15:29:08,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-13 15:29:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:29:08,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756270720] [2022-07-13 15:29:08,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:29:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:29:09,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 15:29:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:29:09,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 15:29:09,548 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 15:29:09,549 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:29:09,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 15:29:09,557 INFO L356 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] [2022-07-13 15:29:09,560 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:29:09,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:29:09 BoogieIcfgContainer [2022-07-13 15:29:09,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:29:09,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:29:09,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:29:09,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:29:09,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:28:06" (3/4) ... [2022-07-13 15:29:09,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 15:29:09,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:29:09,701 INFO L158 Benchmark]: Toolchain (without parser) took 66234.01ms. Allocated memory was 98.6MB in the beginning and 161.5MB in the end (delta: 62.9MB). Free memory was 71.5MB in the beginning and 97.6MB in the end (delta: -26.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,701 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:29:09,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.43ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 71.3MB in the beginning and 87.4MB in the end (delta: -16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.64ms. Allocated memory is still 130.0MB. Free memory was 87.4MB in the beginning and 82.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,702 INFO L158 Benchmark]: Boogie Preprocessor took 58.25ms. Allocated memory is still 130.0MB. Free memory was 82.8MB in the beginning and 76.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,702 INFO L158 Benchmark]: RCFGBuilder took 2905.66ms. Allocated memory is still 130.0MB. Free memory was 76.1MB in the beginning and 84.0MB in the end (delta: -8.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,703 INFO L158 Benchmark]: TraceAbstraction took 62819.71ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 83.8MB in the beginning and 97.6MB in the end (delta: -13.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2022-07-13 15:29:09,703 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 161.5MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:29:09,709 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.17ms. Allocated memory is still 98.6MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.43ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 71.3MB in the beginning and 87.4MB in the end (delta: -16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.64ms. Allocated memory is still 130.0MB. Free memory was 87.4MB in the beginning and 82.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.25ms. Allocated memory is still 130.0MB. Free memory was 82.8MB in the beginning and 76.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2905.66ms. Allocated memory is still 130.0MB. Free memory was 76.1MB in the beginning and 84.0MB in the end (delta: -8.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 62819.71ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 83.8MB in the beginning and 97.6MB in the end (delta: -13.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 161.5MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 1658]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:14}, s->wbio={0:-9}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967315, (s->s3)->tmp.new_cipher={-10:0}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.6s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 57.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 8169 SdHoareTripleChecker+Invalid, 56.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4463 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2881 IncrementalHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 3706 mSDtfsCounter, 2881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=976occurred in iteration=18, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 3445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1288/1288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 15:29:09,759 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:29:11,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:29:11,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:29:11,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:29:11,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:29:11,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:29:11,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:29:11,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:29:11,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:29:11,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:29:11,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:29:11,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:29:11,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:29:11,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:29:11,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:29:11,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:29:11,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:29:11,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:29:11,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:29:11,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:29:11,482 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:29:11,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:29:11,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:29:11,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:29:11,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:29:11,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:29:11,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:29:11,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:29:11,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:29:11,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:29:11,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:29:11,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:29:11,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:29:11,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:29:11,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:29:11,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:29:11,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:29:11,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:29:11,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:29:11,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:29:11,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:29:11,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:29:11,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:29:11,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:29:11,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:29:11,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:29:11,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:29:11,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:29:11,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:29:11,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:29:11,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:29:11,535 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:29:11,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:29:11,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:29:11,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:29:11,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:29:11,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:29:11,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:29:11,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:29:11,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:29:11,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:29:11,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:29:11,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:29:11,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:29:11,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:29:11,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:29:11,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:29:11,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:29:11,549 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:29:11,550 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:29:11,550 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:29:11,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:29:11,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:29:11,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:29:11,551 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-13 15:29:11,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:29:11,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:29:11,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:29:11,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:29:11,833 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:29:11,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-13 15:29:11,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af8b022/07d72c3498c24d78a4203d3f9db41bfe/FLAG009de40c9 [2022-07-13 15:29:12,292 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:29:12,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-13 15:29:12,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af8b022/07d72c3498c24d78a4203d3f9db41bfe/FLAG009de40c9 [2022-07-13 15:29:12,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af8b022/07d72c3498c24d78a4203d3f9db41bfe [2022-07-13 15:29:12,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:29:12,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:29:12,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:29:12,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:29:12,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:29:12,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:12" (1/1) ... [2022-07-13 15:29:12,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1575fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:12, skipping insertion in model container [2022-07-13 15:29:12,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:12" (1/1) ... [2022-07-13 15:29:12,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:29:12,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:29:13,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-13 15:29:13,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:29:13,087 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 15:29:13,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:29:13,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-13 15:29:13,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:29:13,164 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:29:13,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-13 15:29:13,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:29:13,246 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:29:13,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13 WrapperNode [2022-07-13 15:29:13,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:29:13,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:29:13,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:29:13,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:29:13,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,338 INFO L137 Inliner]: procedures = 34, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 702 [2022-07-13 15:29:13,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:29:13,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:29:13,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:29:13,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:29:13,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:29:13,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:29:13,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:29:13,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:29:13,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (1/1) ... [2022-07-13 15:29:13,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:29:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:29:13,445 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-07-13 15:29:13,447 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-07-13 15:29:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:29:13,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:29:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:29:13,635 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:29:13,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:29:13,647 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 15:29:20,705 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 15:29:20,705 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 15:29:20,705 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:29:20,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:29:20,710 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 15:29:20,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:20 BoogieIcfgContainer [2022-07-13 15:29:20,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:29:20,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:29:20,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:29:20,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:29:20,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:29:12" (1/3) ... [2022-07-13 15:29:20,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20efe752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:29:20, skipping insertion in model container [2022-07-13 15:29:20,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:13" (2/3) ... [2022-07-13 15:29:20,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20efe752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:29:20, skipping insertion in model container [2022-07-13 15:29:20,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:20" (3/3) ... [2022-07-13 15:29:20,716 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-13 15:29:20,725 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:29:20,726 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:29:20,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:29:20,768 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bc49ed3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cf97310 [2022-07-13 15:29:20,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:29:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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-07-13 15:29:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:29:20,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:20,777 INFO L195 NwaCegarLoop]: 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-07-13 15:29:20,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-13 15:29:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:20,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248171561] [2022-07-13 15:29:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:20,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:20,792 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-07-13 15:29:20,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:29:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:21,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:29:21,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:29:21,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:21,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248171561] [2022-07-13 15:29:21,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248171561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:21,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:21,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375433780] [2022-07-13 15:29:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:21,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:21,413 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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-07-13 15:29:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:21,504 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-13 15:29:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:21,506 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-07-13 15:29:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:21,512 INFO L225 Difference]: With dead ends: 375 [2022-07-13 15:29:21,512 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 15:29:21,515 INFO L412 NwaCegarLoop]: 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-07-13 15:29:21,517 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:21,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:29:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 15:29:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-13 15:29:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 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-07-13 15:29:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-13 15:29:21,563 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-13 15:29:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:21,563 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-13 15:29:21,564 INFO L496 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-07-13 15:29:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-13 15:29:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:29:21,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:21,566 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 15:29:21,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:21,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-13 15:29:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058246811] [2022-07-13 15:29:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:21,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:21,793 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-07-13 15:29:21,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:29:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:22,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:29:22,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:29:22,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:22,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058246811] [2022-07-13 15:29:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058246811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:22,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:22,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011637420] [2022-07-13 15:29:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:22,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:22,436 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-07-13 15:29:24,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:24,597 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-13 15:29:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-07-13 15:29:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:24,599 INFO L225 Difference]: With dead ends: 426 [2022-07-13 15:29:24,600 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 15:29:24,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-07-13 15:29:24,601 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:24,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 15:29:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 15:29:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-13 15:29:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 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-07-13 15:29:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-13 15:29:24,613 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-13 15:29:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:24,613 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-13 15:29:24,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-07-13 15:29:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-13 15:29:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 15:29:24,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:24,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 15:29:24,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:24,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-13 15:29:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067559563] [2022-07-13 15:29:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:24,832 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-07-13 15:29:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:29:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:25,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:29:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 15:29:25,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:25,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067559563] [2022-07-13 15:29:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067559563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:25,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387447569] [2022-07-13 15:29:25,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:25,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:25,513 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-07-13 15:29:27,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:27,633 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-13 15:29:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:27,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 57 [2022-07-13 15:29:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:27,635 INFO L225 Difference]: With dead ends: 632 [2022-07-13 15:29:27,635 INFO L226 Difference]: Without dead ends: 423 [2022-07-13 15:29:27,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-07-13 15:29:27,636 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:27,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 15:29:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-13 15:29:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-13 15:29:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 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-07-13 15:29:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-13 15:29:27,651 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-13 15:29:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:27,651 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-13 15:29:27,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-07-13 15:29:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-13 15:29:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 15:29:27,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:27,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 15:29:27,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:27,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-13 15:29:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:27,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112701635] [2022-07-13 15:29:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:27,861 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-07-13 15:29:27,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:29:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:28,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:29:28,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 15:29:28,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:28,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:28,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112701635] [2022-07-13 15:29:28,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112701635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:28,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:28,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2785777] [2022-07-13 15:29:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:28,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:28,620 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-07-13 15:29:30,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:30,731 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-13 15:29:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 77 [2022-07-13 15:29:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:30,736 INFO L225 Difference]: With dead ends: 839 [2022-07-13 15:29:30,737 INFO L226 Difference]: Without dead ends: 526 [2022-07-13 15:29:30,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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-07-13 15:29:30,739 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:30,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 15:29:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-13 15:29:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-13 15:29:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 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-07-13 15:29:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-13 15:29:30,757 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-13 15:29:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:30,758 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-13 15:29:30,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-07-13 15:29:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-13 15:29:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 15:29:30,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:30,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:29:30,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:30,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:30,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-13 15:29:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935244753] [2022-07-13 15:29:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:30,974 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-07-13 15:29:30,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:29:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:31,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:29:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:29:31,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:31,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:31,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935244753] [2022-07-13 15:29:31,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935244753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:31,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:31,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:29:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765250198] [2022-07-13 15:29:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:31,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:29:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:29:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:29:31,728 INFO L87 Difference]: Start difference. First operand 526 states and 773 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-07-13 15:29:33,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:33,831 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-13 15:29:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:29:33,831 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 98 [2022-07-13 15:29:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:33,833 INFO L225 Difference]: With dead ends: 939 [2022-07-13 15:29:33,833 INFO L226 Difference]: Without dead ends: 523 [2022-07-13 15:29:33,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-07-13 15:29:33,835 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:33,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 15:29:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-13 15:29:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-13 15:29:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 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-07-13 15:29:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-13 15:29:33,843 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-13 15:29:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:33,844 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-13 15:29:33,844 INFO L496 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-07-13 15:29:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-13 15:29:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 15:29:33,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:33,846 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:29:33,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:34,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:34,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-13 15:29:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338182913] [2022-07-13 15:29:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:34,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:34,061 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-07-13 15:29:34,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:29:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:35,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:29:35,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:35,204 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-13 15:29:35,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-13 15:29:35,438 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 15:29:35,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-13 15:29:35,561 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:29:35,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-13 15:29:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 15:29:35,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:35,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:35,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338182913] [2022-07-13 15:29:35,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338182913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:35,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:35,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:29:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159698174] [2022-07-13 15:29:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:29:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:29:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:29:35,602 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-07-13 15:29:37,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:41,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:42,155 INFO L93 Difference]: Finished difference Result 1191 states and 1739 transitions. [2022-07-13 15:29:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:29:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 100 [2022-07-13 15:29:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:42,163 INFO L225 Difference]: With dead ends: 1191 [2022-07-13 15:29:42,163 INFO L226 Difference]: Without dead ends: 675 [2022-07-13 15:29:42,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:29:42,167 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:42,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 30 Unchecked, 6.5s Time] [2022-07-13 15:29:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-13 15:29:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-07-13 15:29:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.49009900990099) internal successors, (903), 606 states have internal predecessors, (903), 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-07-13 15:29:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 903 transitions. [2022-07-13 15:29:42,192 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 903 transitions. Word has length 100 [2022-07-13 15:29:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:42,192 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 903 transitions. [2022-07-13 15:29:42,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-07-13 15:29:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 903 transitions. [2022-07-13 15:29:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 15:29:42,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:42,194 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 15:29:42,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:42,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:42,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2022-07-13 15:29:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:42,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838880618] [2022-07-13 15:29:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:42,418 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-07-13 15:29:42,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:29:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:29:43,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:29:43,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:29:43,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:29:43,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:29:43,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:29:43,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:29:43,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:29:43,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:29:44,321 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-13 15:29:44,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-13 15:29:45,017 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:29:45,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-13 15:29:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:29:45,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:29:45,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:29:45,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838880618] [2022-07-13 15:29:45,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838880618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:29:45,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:29:45,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:29:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941946473] [2022-07-13 15:29:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:29:45,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:29:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:29:45,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:29:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:29:45,048 INFO L87 Difference]: Start difference. First operand 607 states and 903 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-07-13 15:29:47,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:49,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:29:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:29:58,859 INFO L93 Difference]: Finished difference Result 1413 states and 2092 transitions. [2022-07-13 15:29:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:29:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 100 [2022-07-13 15:29:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:29:58,870 INFO L225 Difference]: With dead ends: 1413 [2022-07-13 15:29:58,870 INFO L226 Difference]: Without dead ends: 813 [2022-07-13 15:29:58,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:29:58,872 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 46 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-07-13 15:29:58,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 508 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2022-07-13 15:29:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-13 15:29:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 703. [2022-07-13 15:29:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.5256410256410255) internal successors, (1071), 702 states have internal predecessors, (1071), 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-07-13 15:29:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1071 transitions. [2022-07-13 15:29:58,891 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1071 transitions. Word has length 100 [2022-07-13 15:29:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:29:58,892 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1071 transitions. [2022-07-13 15:29:58,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-07-13 15:29:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1071 transitions. [2022-07-13 15:29:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 15:29:58,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:29:58,894 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1] [2022-07-13 15:29:58,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:29:59,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:29:59,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:29:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:29:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2022-07-13 15:29:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:29:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084181537] [2022-07-13 15:29:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:29:59,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:29:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:29:59,106 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-07-13 15:29:59,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:30:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:01,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:01,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:01,700 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 15:30:01,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:01,771 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:01,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:01,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:01,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:01,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084181537] [2022-07-13 15:30:01,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084181537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:01,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:01,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793525122] [2022-07-13 15:30:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:01,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:01,801 INFO L87 Difference]: Start difference. First operand 703 states and 1071 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:03,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:05,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:06,951 INFO L93 Difference]: Finished difference Result 1464 states and 2226 transitions. [2022-07-13 15:30:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 115 [2022-07-13 15:30:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:06,955 INFO L225 Difference]: With dead ends: 1464 [2022-07-13 15:30:06,956 INFO L226 Difference]: Without dead ends: 768 [2022-07-13 15:30:06,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:06,957 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:06,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 1 Unknown, 15 Unchecked, 5.1s Time] [2022-07-13 15:30:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-13 15:30:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-07-13 15:30:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.5032594524119949) internal successors, (1153), 767 states have internal predecessors, (1153), 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-07-13 15:30:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1153 transitions. [2022-07-13 15:30:06,976 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1153 transitions. Word has length 115 [2022-07-13 15:30:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:06,976 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1153 transitions. [2022-07-13 15:30:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1153 transitions. [2022-07-13 15:30:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 15:30:06,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:06,978 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2022-07-13 15:30:07,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:07,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:07,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2022-07-13 15:30:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:07,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001395237] [2022-07-13 15:30:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:07,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:07,194 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-07-13 15:30:07,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 15:30:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:08,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:08,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:09,360 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 15:30:09,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:09,455 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:09,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:09,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:09,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001395237] [2022-07-13 15:30:09,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001395237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:09,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129384864] [2022-07-13 15:30:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:09,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:09,492 INFO L87 Difference]: Start difference. First operand 768 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:11,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:15,506 INFO L93 Difference]: Finished difference Result 1534 states and 2305 transitions. [2022-07-13 15:30:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 115 [2022-07-13 15:30:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:15,511 INFO L225 Difference]: With dead ends: 1534 [2022-07-13 15:30:15,511 INFO L226 Difference]: Without dead ends: 773 [2022-07-13 15:30:15,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:15,512 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:15,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 1 Unknown, 18 Unchecked, 6.0s Time] [2022-07-13 15:30:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-13 15:30:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-07-13 15:30:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 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-07-13 15:30:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2022-07-13 15:30:15,526 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 115 [2022-07-13 15:30:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:15,526 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2022-07-13 15:30:15,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2022-07-13 15:30:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 15:30:15,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:15,528 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-07-13 15:30:15,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:15,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:15,750 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2022-07-13 15:30:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:15,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932440969] [2022-07-13 15:30:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:15,753 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-07-13 15:30:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 15:30:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:17,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:17,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:18,129 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:30:18,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:18,280 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:18,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:18,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:18,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:18,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932440969] [2022-07-13 15:30:18,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932440969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:18,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:18,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063708892] [2022-07-13 15:30:18,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:18,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:18,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:18,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:18,329 INFO L87 Difference]: Start difference. First operand 773 states and 1150 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:20,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:24,619 INFO L93 Difference]: Finished difference Result 1415 states and 2093 transitions. [2022-07-13 15:30:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:24,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 115 [2022-07-13 15:30:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:24,634 INFO L225 Difference]: With dead ends: 1415 [2022-07-13 15:30:24,634 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 15:30:24,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:24,635 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:24,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 19 Unchecked, 6.2s Time] [2022-07-13 15:30:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 15:30:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 773. [2022-07-13 15:30:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4844559585492227) internal successors, (1146), 772 states have internal predecessors, (1146), 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-07-13 15:30:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1146 transitions. [2022-07-13 15:30:24,653 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1146 transitions. Word has length 115 [2022-07-13 15:30:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:24,653 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1146 transitions. [2022-07-13 15:30:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07-13 15:30:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1146 transitions. [2022-07-13 15:30:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 15:30:24,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:24,655 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1] [2022-07-13 15:30:24,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:24,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:24,863 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2022-07-13 15:30:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:24,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398768178] [2022-07-13 15:30:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:24,866 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-07-13 15:30:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 15:30:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:27,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:27,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:27,695 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 15:30:27,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:27,825 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:27,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:27,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:27,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398768178] [2022-07-13 15:30:27,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398768178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:27,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:27,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217237026] [2022-07-13 15:30:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:27,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:27,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:27,869 INFO L87 Difference]: Start difference. First operand 773 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-13 15:30:29,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:34,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:34,203 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2022-07-13 15:30:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 116 [2022-07-13 15:30:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:34,209 INFO L225 Difference]: With dead ends: 1544 [2022-07-13 15:30:34,209 INFO L226 Difference]: Without dead ends: 778 [2022-07-13 15:30:34,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:34,211 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:34,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 1 Unknown, 17 Unchecked, 6.3s Time] [2022-07-13 15:30:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-13 15:30:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-07-13 15:30:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.471042471042471) internal successors, (1143), 777 states have internal predecessors, (1143), 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-07-13 15:30:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2022-07-13 15:30:34,256 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 116 [2022-07-13 15:30:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:34,256 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2022-07-13 15:30:34,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-13 15:30:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2022-07-13 15:30:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 15:30:34,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:34,258 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 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-07-13 15:30:34,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:34,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:34,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash -710278962, now seen corresponding path program 1 times [2022-07-13 15:30:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:34,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786530815] [2022-07-13 15:30:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:34,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:34,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:34,478 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-07-13 15:30:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 15:30:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:35,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:35,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:36,380 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:30:36,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:36,495 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:36,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:36,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:36,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786530815] [2022-07-13 15:30:36,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786530815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:36,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:36,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603183775] [2022-07-13 15:30:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:36,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:36,531 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-13 15:30:38,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:43,025 INFO L93 Difference]: Finished difference Result 1424 states and 2081 transitions. [2022-07-13 15:30:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 116 [2022-07-13 15:30:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:43,031 INFO L225 Difference]: With dead ends: 1424 [2022-07-13 15:30:43,031 INFO L226 Difference]: Without dead ends: 814 [2022-07-13 15:30:43,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:43,035 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:43,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 20 Unchecked, 6.4s Time] [2022-07-13 15:30:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-13 15:30:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 778. [2022-07-13 15:30:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.465894465894466) internal successors, (1139), 777 states have internal predecessors, (1139), 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-07-13 15:30:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1139 transitions. [2022-07-13 15:30:43,051 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1139 transitions. Word has length 116 [2022-07-13 15:30:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:43,051 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1139 transitions. [2022-07-13 15:30:43,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-13 15:30:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1139 transitions. [2022-07-13 15:30:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 15:30:43,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:43,053 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1] [2022-07-13 15:30:43,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:43,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2022-07-13 15:30:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:43,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911286308] [2022-07-13 15:30:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:43,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:43,273 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-07-13 15:30:43,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 15:30:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:44,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:44,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:45,439 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 15:30:45,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:45,541 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:45,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:45,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:45,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:45,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911286308] [2022-07-13 15:30:45,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911286308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:45,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145398838] [2022-07-13 15:30:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:45,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:45,574 INFO L87 Difference]: Start difference. First operand 778 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-13 15:30:47,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:49,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:52,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:30:52,389 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-13 15:30:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:30:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 117 [2022-07-13 15:30:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:30:52,393 INFO L225 Difference]: With dead ends: 1554 [2022-07-13 15:30:52,393 INFO L226 Difference]: Without dead ends: 783 [2022-07-13 15:30:52,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:30:52,396 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:30:52,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 1 Unknown, 19 Unchecked, 6.8s Time] [2022-07-13 15:30:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-07-13 15:30:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-07-13 15:30:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 states have internal predecessors, (1136), 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-07-13 15:30:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2022-07-13 15:30:52,412 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 117 [2022-07-13 15:30:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:30:52,412 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2022-07-13 15:30:52,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-13 15:30:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2022-07-13 15:30:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 15:30:52,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:30:52,414 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 1, 1] [2022-07-13 15:30:52,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 15:30:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:30:52,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:30:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:30:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2022-07-13 15:30:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:30:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733453373] [2022-07-13 15:30:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:30:52,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:30:52,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:30:52,630 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-07-13 15:30:52,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 15:30:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:30:54,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:30:54,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:30:54,937 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 15:30:54,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:30:55,051 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:30:55,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:30:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:30:55,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:30:55,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:30:55,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733453373] [2022-07-13 15:30:55,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733453373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:30:55,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:30:55,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:30:55,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229542069] [2022-07-13 15:30:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:30:55,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:30:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:30:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:30:55,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:30:55,087 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:30:57,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:30:59,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:01,988 INFO L93 Difference]: Finished difference Result 1564 states and 2271 transitions. [2022-07-13 15:31:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 118 [2022-07-13 15:31:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:01,993 INFO L225 Difference]: With dead ends: 1564 [2022-07-13 15:31:01,993 INFO L226 Difference]: Without dead ends: 788 [2022-07-13 15:31:01,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:31:01,994 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:01,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 21 Unchecked, 6.8s Time] [2022-07-13 15:31:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-13 15:31:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-13 15:31:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4396442185514613) internal successors, (1133), 787 states have internal predecessors, (1133), 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-07-13 15:31:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2022-07-13 15:31:02,008 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 118 [2022-07-13 15:31:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:02,008 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2022-07-13 15:31:02,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:31:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2022-07-13 15:31:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 15:31:02,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:02,010 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 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] [2022-07-13 15:31:02,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:02,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:02,229 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2022-07-13 15:31:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132937326] [2022-07-13 15:31:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:02,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:02,231 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-07-13 15:31:02,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 15:31:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:04,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:31:04,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:04,582 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:31:04,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:31:04,716 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:31:04,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:31:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:31:04,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:04,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:04,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132937326] [2022-07-13 15:31:04,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132937326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:04,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:04,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88333314] [2022-07-13 15:31:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:04,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:04,750 INFO L87 Difference]: Start difference. First operand 788 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:31:06,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:10,802 INFO L93 Difference]: Finished difference Result 1569 states and 2255 transitions. [2022-07-13 15:31:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 118 [2022-07-13 15:31:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:10,807 INFO L225 Difference]: With dead ends: 1569 [2022-07-13 15:31:10,807 INFO L226 Difference]: Without dead ends: 788 [2022-07-13 15:31:10,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:31:10,808 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:10,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 18 Unchecked, 6.0s Time] [2022-07-13 15:31:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-13 15:31:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-13 15:31:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 787 states have internal predecessors, (1129), 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-07-13 15:31:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1129 transitions. [2022-07-13 15:31:10,829 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1129 transitions. Word has length 118 [2022-07-13 15:31:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:10,829 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1129 transitions. [2022-07-13 15:31:10,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:31:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1129 transitions. [2022-07-13 15:31:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 15:31:10,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:10,831 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 15:31:10,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:11,047 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105215, now seen corresponding path program 1 times [2022-07-13 15:31:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221386175] [2022-07-13 15:31:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:11,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:11,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:11,050 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-07-13 15:31:11,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 15:31:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:12,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:31:12,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:13,402 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:31:13,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:31:13,563 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:31:13,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:31:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:31:13,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:13,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:13,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221386175] [2022-07-13 15:31:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221386175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88614913] [2022-07-13 15:31:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:13,602 INFO L87 Difference]: Start difference. First operand 788 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:31:15,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:19,215 INFO L93 Difference]: Finished difference Result 1583 states and 2264 transitions. [2022-07-13 15:31:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 118 [2022-07-13 15:31:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:19,220 INFO L225 Difference]: With dead ends: 1583 [2022-07-13 15:31:19,220 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 15:31:19,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:31:19,221 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:19,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 1 Unknown, 22 Unchecked, 5.6s Time] [2022-07-13 15:31:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 15:31:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-13 15:31:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4294790343074968) internal successors, (1125), 787 states have internal predecessors, (1125), 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-07-13 15:31:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1125 transitions. [2022-07-13 15:31:19,233 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1125 transitions. Word has length 118 [2022-07-13 15:31:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:19,233 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1125 transitions. [2022-07-13 15:31:19,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-07-13 15:31:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1125 transitions. [2022-07-13 15:31:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 15:31:19,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:19,235 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2022-07-13 15:31:19,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:19,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1012937024, now seen corresponding path program 1 times [2022-07-13 15:31:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733919788] [2022-07-13 15:31:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:19,453 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-07-13 15:31:19,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 15:31:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:21,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:31:21,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:21,693 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:31:21,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:31:21,839 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:31:21,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:31:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:31:21,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:21,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733919788] [2022-07-13 15:31:21,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733919788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:21,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775392559] [2022-07-13 15:31:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:21,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:21,873 INFO L87 Difference]: Start difference. First operand 788 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-07-13 15:31:23,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:27,047 INFO L93 Difference]: Finished difference Result 1583 states and 2256 transitions. [2022-07-13 15:31:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 119 [2022-07-13 15:31:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:27,051 INFO L225 Difference]: With dead ends: 1583 [2022-07-13 15:31:27,051 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 15:31:27,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:31:27,052 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:27,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 24 Unchecked, 5.1s Time] [2022-07-13 15:31:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 15:31:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-13 15:31:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4243964421855146) internal successors, (1121), 787 states have internal predecessors, (1121), 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-07-13 15:31:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2022-07-13 15:31:27,066 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 119 [2022-07-13 15:31:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:27,066 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2022-07-13 15:31:27,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-07-13 15:31:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2022-07-13 15:31:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 15:31:27,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:27,068 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 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] [2022-07-13 15:31:27,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:27,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:27,288 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2022-07-13 15:31:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285030084] [2022-07-13 15:31:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:27,290 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-07-13 15:31:27,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 15:31:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:28,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:31:28,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:29,451 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 15:31:29,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 15:31:29,584 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 15:31:29,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 15:31:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 15:31:29,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:29,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:29,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285030084] [2022-07-13 15:31:29,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285030084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:29,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:29,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109689633] [2022-07-13 15:31:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:29,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:29,621 INFO L87 Difference]: Start difference. First operand 788 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-07-13 15:31:31,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:34,748 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2022-07-13 15:31:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 119 [2022-07-13 15:31:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:34,752 INFO L225 Difference]: With dead ends: 1569 [2022-07-13 15:31:34,753 INFO L226 Difference]: Without dead ends: 788 [2022-07-13 15:31:34,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:31:34,754 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:34,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 1 Unknown, 18 Unchecked, 5.1s Time] [2022-07-13 15:31:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-13 15:31:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-13 15:31:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4193138500635325) internal successors, (1117), 787 states have internal predecessors, (1117), 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-07-13 15:31:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2022-07-13 15:31:34,789 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 119 [2022-07-13 15:31:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2022-07-13 15:31:34,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-07-13 15:31:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2022-07-13 15:31:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 15:31:34,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:34,791 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-13 15:31:34,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:35,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:35,004 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-13 15:31:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:35,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733476056] [2022-07-13 15:31:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:35,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:35,006 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-07-13 15:31:35,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 15:31:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:37,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:31:37,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:37,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:31:37,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:37,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-13 15:31:40,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:40,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:40,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-13 15:31:40,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:40,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-13 15:31:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 15:31:40,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:40,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:40,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733476056] [2022-07-13 15:31:40,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733476056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:40,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:40,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002301594] [2022-07-13 15:31:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:40,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:40,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:40,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:40,921 INFO L87 Difference]: Start difference. First operand 788 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-07-13 15:31:42,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:42,974 INFO L93 Difference]: Finished difference Result 1419 states and 2013 transitions. [2022-07-13 15:31:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 122 [2022-07-13 15:31:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:42,976 INFO L225 Difference]: With dead ends: 1419 [2022-07-13 15:31:42,976 INFO L226 Difference]: Without dead ends: 801 [2022-07-13 15:31:42,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:42,977 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:42,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.0s Time] [2022-07-13 15:31:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-07-13 15:31:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2022-07-13 15:31:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4223057644110275) internal successors, (1135), 798 states have internal predecessors, (1135), 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-07-13 15:31:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1135 transitions. [2022-07-13 15:31:42,997 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1135 transitions. Word has length 122 [2022-07-13 15:31:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1135 transitions. [2022-07-13 15:31:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-07-13 15:31:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1135 transitions. [2022-07-13 15:31:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 15:31:42,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:42,999 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-13 15:31:43,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:43,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:43,215 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 787843816, now seen corresponding path program 1 times [2022-07-13 15:31:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:43,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610584148] [2022-07-13 15:31:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:43,217 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-07-13 15:31:43,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 15:31:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:45,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:31:45,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:45,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:31:45,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:45,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-13 15:31:48,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:48,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:48,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-13 15:31:48,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:48,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-13 15:31:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 15:31:48,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:48,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610584148] [2022-07-13 15:31:48,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610584148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:48,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:48,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129528007] [2022-07-13 15:31:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:48,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:48,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:48,924 INFO L87 Difference]: Start difference. First operand 799 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-07-13 15:31:50,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:31:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:31:50,977 INFO L93 Difference]: Finished difference Result 1420 states and 2014 transitions. [2022-07-13 15:31:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:31:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 123 [2022-07-13 15:31:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:31:50,980 INFO L225 Difference]: With dead ends: 1420 [2022-07-13 15:31:50,980 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 15:31:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:50,981 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:31:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 401 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.0s Time] [2022-07-13 15:31:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 15:31:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2022-07-13 15:31:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4217772215269087) internal successors, (1136), 799 states have internal predecessors, (1136), 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-07-13 15:31:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1136 transitions. [2022-07-13 15:31:50,993 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1136 transitions. Word has length 123 [2022-07-13 15:31:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:31:50,993 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1136 transitions. [2022-07-13 15:31:50,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-07-13 15:31:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1136 transitions. [2022-07-13 15:31:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 15:31:50,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:31:50,995 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-13 15:31:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 15:31:51,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:31:51,203 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:31:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:31:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524401, now seen corresponding path program 1 times [2022-07-13 15:31:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:31:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263122538] [2022-07-13 15:31:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:31:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:31:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:31:51,205 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-07-13 15:31:51,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 15:31:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:31:54,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:31:54,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:31:54,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:31:54,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:54,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-13 15:31:56,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:31:56,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:56,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-13 15:31:57,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:31:57,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-13 15:31:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 15:31:57,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:31:57,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:31:57,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263122538] [2022-07-13 15:31:57,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263122538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:31:57,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:31:57,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:31:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109262410] [2022-07-13 15:31:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:31:57,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:31:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:31:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:31:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:31:57,490 INFO L87 Difference]: Start difference. First operand 800 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-07-13 15:31:59,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:32:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:32:01,646 INFO L93 Difference]: Finished difference Result 1428 states and 2027 transitions. [2022-07-13 15:32:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:32:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 123 [2022-07-13 15:32:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:32:01,648 INFO L225 Difference]: With dead ends: 1428 [2022-07-13 15:32:01,648 INFO L226 Difference]: Without dead ends: 810 [2022-07-13 15:32:01,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:32:01,649 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:32:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 436 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 102 Unchecked, 2.1s Time] [2022-07-13 15:32:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-13 15:32:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-07-13 15:32:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4237918215613383) internal successors, (1149), 807 states have internal predecessors, (1149), 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-07-13 15:32:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1149 transitions. [2022-07-13 15:32:01,664 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1149 transitions. Word has length 123 [2022-07-13 15:32:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:32:01,664 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1149 transitions. [2022-07-13 15:32:01,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-07-13 15:32:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1149 transitions. [2022-07-13 15:32:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 15:32:01,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:32:01,666 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-13 15:32:01,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 15:32:01,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:32:01,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:32:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:32:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash -935560660, now seen corresponding path program 1 times [2022-07-13 15:32:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:32:01,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272149211] [2022-07-13 15:32:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:32:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:32:01,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:32:01,882 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-07-13 15:32:01,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-13 15:32:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:32:04,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 15:32:04,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:32:04,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:32:04,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:04,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-13 15:32:06,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:06,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:32:07,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:32:07,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-13 15:32:07,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:32:07,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-13 15:32:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 15:32:07,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:32:07,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:32:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272149211] [2022-07-13 15:32:07,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272149211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:32:07,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:32:07,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:32:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451194267] [2022-07-13 15:32:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:32:07,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:32:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:32:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:32:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:32:07,797 INFO L87 Difference]: Start difference. First operand 808 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07-13 15:32:09,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 15:32:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:32:09,869 INFO L93 Difference]: Finished difference Result 1429 states and 2028 transitions. [2022-07-13 15:32:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:32:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 124 [2022-07-13 15:32:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:32:09,872 INFO L225 Difference]: With dead ends: 1429 [2022-07-13 15:32:09,872 INFO L226 Difference]: Without dead ends: 811 [2022-07-13 15:32:09,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:32:09,873 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:32:09,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 436 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 101 Unchecked, 2.1s Time] [2022-07-13 15:32:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-13 15:32:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 797. [2022-07-13 15:32:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.420854271356784) internal successors, (1131), 796 states have internal predecessors, (1131), 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-07-13 15:32:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1131 transitions. [2022-07-13 15:32:09,894 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1131 transitions. Word has length 124 [2022-07-13 15:32:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:32:09,894 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1131 transitions. [2022-07-13 15:32:09,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07-13 15:32:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1131 transitions. [2022-07-13 15:32:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 15:32:09,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:32:09,896 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-07-13 15:32:09,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-13 15:32:10,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:32:10,115 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:32:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:32:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-13 15:32:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:32:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809726189] [2022-07-13 15:32:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:32:10,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:32:10,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:32:10,118 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-07-13 15:32:10,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-13 15:32:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:32:14,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 15:32:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 15:32:17,543 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 15:32:17,543 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 15:32:17,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:32:17,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-13 15:32:17,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:32:17,762 INFO L356 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] [2022-07-13 15:32:17,771 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:32:17,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:32:17 BoogieIcfgContainer [2022-07-13 15:32:17,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:32:17,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:32:17,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:32:17,917 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:32:17,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:20" (3/4) ... [2022-07-13 15:32:17,919 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 15:32:18,012 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:32:18,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:32:18,013 INFO L158 Benchmark]: Toolchain (without parser) took 185356.00ms. Allocated memory was 58.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Free memory was 35.9MB in the beginning and 32.6MB in the end (delta: 3.4MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,014 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:32:18,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.48ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.7MB in the beginning and 40.4MB in the end (delta: -4.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.24ms. Allocated memory is still 71.3MB. Free memory was 40.4MB in the beginning and 35.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,015 INFO L158 Benchmark]: Boogie Preprocessor took 67.02ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 47.7MB in the end (delta: -11.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,018 INFO L158 Benchmark]: RCFGBuilder took 7299.33ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 44.6MB in the end (delta: 3.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,018 INFO L158 Benchmark]: TraceAbstraction took 177204.14ms. Allocated memory is still 90.2MB. Free memory was 43.8MB in the beginning and 32.7MB in the end (delta: 11.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,019 INFO L158 Benchmark]: Witness Printer took 95.65ms. Allocated memory is still 90.2MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 157.0kB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-13 15:32:18,021 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.15ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.48ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.7MB in the beginning and 40.4MB in the end (delta: -4.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.24ms. Allocated memory is still 71.3MB. Free memory was 40.4MB in the beginning and 35.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.02ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 47.7MB in the end (delta: -11.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 7299.33ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 44.6MB in the end (delta: 3.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 177204.14ms. Allocated memory is still 90.2MB. Free memory was 43.8MB in the beginning and 32.7MB in the end (delta: 11.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 95.65ms. Allocated memory is still 90.2MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 157.0kB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 1658]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->info_callback={0:-2147467264}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] EXPR s->version VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->version=768, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->init_buf={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->bbio={0:-2147483648}, s->wbio={0:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1339] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147467264}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={34:0}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1658] reach_error() VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 177.0s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 105.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 102.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 9805 SdHoareTripleChecker+Invalid, 99.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 614 IncrementalHoareTripleChecker+Unchecked, 5282 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1355 IncrementalHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 4523 mSDtfsCounter, 1355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2265 GetRequests, 2211 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=21, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 298 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 28.2s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2251 ConstructedInterpolants, 56 QuantifiedInterpolants, 8185 SizeOfPredicates, 67 NumberOfNonLiveVariables, 20556 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 3098/3098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 15:32:18,075 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE