./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/bitvector/s3_clnt_2.BV.c.cil-1a.c -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 310063ef643a90e947dd66ba142cc8ae546f077a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/bitvector/s3_clnt_2.BV.c.cil-1a.c -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 310063ef643a90e947dd66ba142cc8ae546f077a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 19:59:08,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:59:08,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:59:08,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:59:08,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:59:08,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:59:08,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:59:08,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:59:08,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:59:08,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:59:08,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:59:08,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:59:08,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:59:08,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:59:08,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:59:08,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:59:08,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:59:08,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:59:08,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:59:08,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:59:08,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:59:08,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:59:08,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:59:08,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:59:08,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:59:08,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:59:08,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:59:08,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:59:08,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:59:08,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:59:08,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:59:08,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:59:08,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:59:08,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:59:08,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:59:08,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:59:08,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:59:08,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:59:08,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:59:08,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:59:08,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:59:08,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 19:59:08,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:59:08,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:59:08,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:59:08,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:59:08,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:59:08,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:59:08,742 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:59:08,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:59:08,742 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:59:08,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 19:59:08,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:59:08,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:59:08,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:59:08,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:59:08,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:59:08,744 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:59:08,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:59:08,745 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:59:08,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:59:08,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:59:08,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:59:08,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:59:08,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:59:08,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:59:08,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:59:08,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:59:08,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 19:59:08,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 19:59:08,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:59:08,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:59:08,747 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 -> 310063ef643a90e947dd66ba142cc8ae546f077a [2021-08-25 19:59:09,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:59:09,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:59:09,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:59:09,041 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:59:09,041 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:59:09,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:09,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cbc5e63/da0b19cd79c94d5798d8c7de09c62e4a/FLAG0e80f1cff [2021-08-25 19:59:09,504 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:59:09,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:09,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cbc5e63/da0b19cd79c94d5798d8c7de09c62e4a/FLAG0e80f1cff [2021-08-25 19:59:09,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cbc5e63/da0b19cd79c94d5798d8c7de09c62e4a [2021-08-25 19:59:09,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:59:09,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:59:09,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:59:09,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:59:09,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:59:09,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:59:09" (1/1) ... [2021-08-25 19:59:09,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfbe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:09, skipping insertion in model container [2021-08-25 19:59:09,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:59:09" (1/1) ... [2021-08-25 19:59:09,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:59:09,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:59:10,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37270,37283] [2021-08-25 19:59:10,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:59:10,140 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:59:10,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37270,37283] [2021-08-25 19:59:10,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:59:10,237 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:59:10,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10 WrapperNode [2021-08-25 19:59:10,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:59:10,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:59:10,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:59:10,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:59:10,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:59:10,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:59:10,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:59:10,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:59:10,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:59:10,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:59:10,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:59:10,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:59:10,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (1/1) ... [2021-08-25 19:59:10,383 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:59:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:59:10,402 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) [2021-08-25 19:59:10,430 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 [2021-08-25 19:59:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 19:59:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:59:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:59:10,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:59:10,554 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 19:59:10,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 19:59:10,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 19:59:10,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:59:10,921 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 19:59:10,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:10 BoogieIcfgContainer [2021-08-25 19:59:10,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:59:10,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:59:10,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:59:10,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:59:10,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:59:09" (1/3) ... [2021-08-25 19:59:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8a5816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:59:10, skipping insertion in model container [2021-08-25 19:59:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:10" (2/3) ... [2021-08-25 19:59:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8a5816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:59:10, skipping insertion in model container [2021-08-25 19:59:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:10" (3/3) ... [2021-08-25 19:59:10,930 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:10,935 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:59:10,935 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:59:10,974 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:59:10,980 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:59:10,980 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:59:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 19:59:11,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:11,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:11,001 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2021-08-25 19:59:11,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:11,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895793592] [2021-08-25 19:59:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:11,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:11,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:11,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895793592] [2021-08-25 19:59:11,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895793592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:11,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:11,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:11,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616876678] [2021-08-25 19:59:11,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:11,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,194 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 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) [2021-08-25 19:59:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:11,388 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2021-08-25 19:59:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:11,389 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 [2021-08-25 19:59:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:11,399 INFO L225 Difference]: With dead ends: 246 [2021-08-25 19:59:11,400 INFO L226 Difference]: Without dead ends: 112 [2021-08-25 19:59:11,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-25 19:59:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-25 19:59:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-08-25 19:59:11,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2021-08-25 19:59:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:11,455 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-08-25 19:59:11,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-08-25 19:59:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 19:59:11,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:11,459 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:11,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 19:59:11,460 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2021-08-25 19:59:11,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:11,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036255924] [2021-08-25 19:59:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:11,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:11,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:11,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036255924] [2021-08-25 19:59:11,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036255924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:11,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:11,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:11,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757108307] [2021-08-25 19:59:11,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:11,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:11,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,580 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:11,708 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2021-08-25 19:59:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-25 19:59:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:11,713 INFO L225 Difference]: With dead ends: 233 [2021-08-25 19:59:11,713 INFO L226 Difference]: Without dead ends: 131 [2021-08-25 19:59:11,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-25 19:59:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-08-25 19:59:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2021-08-25 19:59:11,735 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2021-08-25 19:59:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:11,736 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2021-08-25 19:59:11,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2021-08-25 19:59:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 19:59:11,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:11,740 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:11,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 19:59:11,741 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2021-08-25 19:59:11,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:11,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965360730] [2021-08-25 19:59:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:11,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:59:11,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:11,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965360730] [2021-08-25 19:59:11,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965360730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:11,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:11,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:11,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509632299] [2021-08-25 19:59:11,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:11,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,833 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:11,959 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2021-08-25 19:59:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 50 [2021-08-25 19:59:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:11,961 INFO L225 Difference]: With dead ends: 265 [2021-08-25 19:59:11,961 INFO L226 Difference]: Without dead ends: 148 [2021-08-25 19:59:11,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-25 19:59:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2021-08-25 19:59:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2021-08-25 19:59:11,981 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2021-08-25 19:59:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:11,981 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2021-08-25 19:59:11,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2021-08-25 19:59:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 19:59:11,982 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:11,982 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:11,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 19:59:11,983 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2021-08-25 19:59:11,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:11,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679346684] [2021-08-25 19:59:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:11,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:12,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679346684] [2021-08-25 19:59:12,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679346684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134245301] [2021-08-25 19:59:12,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,091 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2021-08-25 19:59:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,242 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2021-08-25 19:59:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 67 [2021-08-25 19:59:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,243 INFO L225 Difference]: With dead ends: 328 [2021-08-25 19:59:12,243 INFO L226 Difference]: Without dead ends: 193 [2021-08-25 19:59:12,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-25 19:59:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2021-08-25 19:59:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4184782608695652) internal successors, (261), 184 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2021-08-25 19:59:12,249 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2021-08-25 19:59:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,250 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2021-08-25 19:59:12,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2021-08-25 19:59:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2021-08-25 19:59:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 19:59:12,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,251 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 19:59:12,251 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1434615126, now seen corresponding path program 1 times [2021-08-25 19:59:12,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887196446] [2021-08-25 19:59:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:12,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887196446] [2021-08-25 19:59:12,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887196446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303106392] [2021-08-25 19:59:12,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,294 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2021-08-25 19:59:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,423 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2021-08-25 19:59:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 67 [2021-08-25 19:59:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,425 INFO L225 Difference]: With dead ends: 383 [2021-08-25 19:59:12,425 INFO L226 Difference]: Without dead ends: 208 [2021-08-25 19:59:12,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-25 19:59:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2021-08-25 19:59:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2021-08-25 19:59:12,433 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2021-08-25 19:59:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,436 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2021-08-25 19:59:12,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2021-08-25 19:59:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2021-08-25 19:59:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 19:59:12,441 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,441 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 19:59:12,442 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1023824768, now seen corresponding path program 1 times [2021-08-25 19:59:12,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288962235] [2021-08-25 19:59:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 19:59:12,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288962235] [2021-08-25 19:59:12,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288962235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724858844] [2021-08-25 19:59:12,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,542 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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) [2021-08-25 19:59:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,665 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2021-08-25 19:59:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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 83 [2021-08-25 19:59:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,667 INFO L225 Difference]: With dead ends: 422 [2021-08-25 19:59:12,667 INFO L226 Difference]: Without dead ends: 228 [2021-08-25 19:59:12,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-25 19:59:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-08-25 19:59:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 224 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2021-08-25 19:59:12,672 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2021-08-25 19:59:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,673 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2021-08-25 19:59:12,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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) [2021-08-25 19:59:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2021-08-25 19:59:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 19:59:12,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,674 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 19:59:12,674 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2021-08-25 19:59:12,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462853280] [2021-08-25 19:59:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 19:59:12,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462853280] [2021-08-25 19:59:12,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462853280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502563263] [2021-08-25 19:59:12,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,721 INFO L87 Difference]: Start difference. First operand 225 states and 311 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) [2021-08-25 19:59:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,752 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2021-08-25 19:59:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,753 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 103 [2021-08-25 19:59:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,754 INFO L225 Difference]: With dead ends: 652 [2021-08-25 19:59:12,755 INFO L226 Difference]: Without dead ends: 437 [2021-08-25 19:59:12,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-08-25 19:59:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-08-25 19:59:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3761467889908257) internal successors, (600), 436 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2021-08-25 19:59:12,765 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2021-08-25 19:59:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,765 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2021-08-25 19:59:12,765 INFO L471 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) [2021-08-25 19:59:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2021-08-25 19:59:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 19:59:12,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,766 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 19:59:12,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash -713589126, now seen corresponding path program 1 times [2021-08-25 19:59:12,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540366945] [2021-08-25 19:59:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 19:59:12,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540366945] [2021-08-25 19:59:12,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540366945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681429784] [2021-08-25 19:59:12,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,810 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,832 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2021-08-25 19:59:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 103 [2021-08-25 19:59:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,834 INFO L225 Difference]: With dead ends: 885 [2021-08-25 19:59:12,834 INFO L226 Difference]: Without dead ends: 458 [2021-08-25 19:59:12,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-08-25 19:59:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2021-08-25 19:59:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3719912472647702) internal successors, (627), 457 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2021-08-25 19:59:12,844 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 103 [2021-08-25 19:59:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,844 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2021-08-25 19:59:12,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2021-08-25 19:59:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 19:59:12,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,845 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 19:59:12,846 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1034569449, now seen corresponding path program 1 times [2021-08-25 19:59:12,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390433181] [2021-08-25 19:59:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 19:59:12,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390433181] [2021-08-25 19:59:12,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390433181] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437618282] [2021-08-25 19:59:12,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,876 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:12,903 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2021-08-25 19:59:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:12,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 19:59:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:12,906 INFO L225 Difference]: With dead ends: 932 [2021-08-25 19:59:12,906 INFO L226 Difference]: Without dead ends: 484 [2021-08-25 19:59:12,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-25 19:59:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-08-25 19:59:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3664596273291925) internal successors, (660), 483 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2021-08-25 19:59:12,915 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2021-08-25 19:59:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:12,916 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2021-08-25 19:59:12,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2021-08-25 19:59:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 19:59:12,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:12,917 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:12,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 19:59:12,917 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2021-08-25 19:59:12,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:12,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624534202] [2021-08-25 19:59:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:12,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 19:59:12,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:12,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624534202] [2021-08-25 19:59:12,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624534202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:12,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:12,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:12,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679755329] [2021-08-25 19:59:12,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:12,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:12,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:12,960 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:13,001 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2021-08-25 19:59:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 19:59:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:13,004 INFO L225 Difference]: With dead ends: 699 [2021-08-25 19:59:13,004 INFO L226 Difference]: Without dead ends: 697 [2021-08-25 19:59:13,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-08-25 19:59:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2021-08-25 19:59:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.3721264367816093) internal successors, (955), 696 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2021-08-25 19:59:13,020 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2021-08-25 19:59:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:13,021 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2021-08-25 19:59:13,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2021-08-25 19:59:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 19:59:13,025 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:13,026 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:13,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 19:59:13,026 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2021-08-25 19:59:13,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:13,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782095917] [2021-08-25 19:59:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:13,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 19:59:13,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:13,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782095917] [2021-08-25 19:59:13,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782095917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:13,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:13,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:13,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682922759] [2021-08-25 19:59:13,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:13,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,084 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:13,259 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2021-08-25 19:59:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:13,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-08-25 19:59:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:13,263 INFO L225 Difference]: With dead ends: 1508 [2021-08-25 19:59:13,263 INFO L226 Difference]: Without dead ends: 844 [2021-08-25 19:59:13,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-08-25 19:59:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2021-08-25 19:59:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4071340713407134) internal successors, (1144), 813 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2021-08-25 19:59:13,280 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 173 [2021-08-25 19:59:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:13,280 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2021-08-25 19:59:13,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2021-08-25 19:59:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-25 19:59:13,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:13,283 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 19:59:13,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 19:59:13,283 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -598161639, now seen corresponding path program 2 times [2021-08-25 19:59:13,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:13,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082529913] [2021-08-25 19:59:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:13,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-25 19:59:13,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:13,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082529913] [2021-08-25 19:59:13,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082529913] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:13,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:13,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:13,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981833865] [2021-08-25 19:59:13,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:13,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,331 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:13,501 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2021-08-25 19:59:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 185 [2021-08-25 19:59:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:13,506 INFO L225 Difference]: With dead ends: 1870 [2021-08-25 19:59:13,506 INFO L226 Difference]: Without dead ends: 1041 [2021-08-25 19:59:13,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-08-25 19:59:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2021-08-25 19:59:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3932135728542914) internal successors, (1396), 1002 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2021-08-25 19:59:13,526 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2021-08-25 19:59:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:13,528 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2021-08-25 19:59:13,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2021-08-25 19:59:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-25 19:59:13,532 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:13,532 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:13,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 19:59:13,532 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2021-08-25 19:59:13,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:13,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131092374] [2021-08-25 19:59:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:13,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-08-25 19:59:13,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:13,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131092374] [2021-08-25 19:59:13,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131092374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:13,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:13,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:13,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084562528] [2021-08-25 19:59:13,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:13,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:13,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:13,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,631 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:13,665 INFO L93 Difference]: Finished difference Result 2282 states and 3180 transitions. [2021-08-25 19:59:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 194 [2021-08-25 19:59:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:13,671 INFO L225 Difference]: With dead ends: 2282 [2021-08-25 19:59:13,671 INFO L226 Difference]: Without dead ends: 1315 [2021-08-25 19:59:13,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-08-25 19:59:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2021-08-25 19:59:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.39117199391172) internal successors, (1828), 1314 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1828 transitions. [2021-08-25 19:59:13,710 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1828 transitions. Word has length 194 [2021-08-25 19:59:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:13,710 INFO L470 AbstractCegarLoop]: Abstraction has 1315 states and 1828 transitions. [2021-08-25 19:59:13,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1828 transitions. [2021-08-25 19:59:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-08-25 19:59:13,714 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:13,714 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:13,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 19:59:13,715 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash -915330113, now seen corresponding path program 1 times [2021-08-25 19:59:13,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:13,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340988382] [2021-08-25 19:59:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:13,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 19:59:13,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:59:13,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340988382] [2021-08-25 19:59:13,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340988382] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:13,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:13,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:59:13,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932393997] [2021-08-25 19:59:13,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:13,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:59:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,774 INFO L87 Difference]: Start difference. First operand 1315 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:13,826 INFO L93 Difference]: Finished difference Result 3583 states and 5032 transitions. [2021-08-25 19:59:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 196 [2021-08-25 19:59:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:13,854 INFO L225 Difference]: With dead ends: 3583 [2021-08-25 19:59:13,855 INFO L226 Difference]: Without dead ends: 2325 [2021-08-25 19:59:13,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2021-08-25 19:59:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2021-08-25 19:59:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2322 states have (on average 1.4061154177433248) internal successors, (3265), 2322 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3265 transitions. [2021-08-25 19:59:13,912 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3265 transitions. Word has length 196 [2021-08-25 19:59:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:13,912 INFO L470 AbstractCegarLoop]: Abstraction has 2323 states and 3265 transitions. [2021-08-25 19:59:13,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3265 transitions. [2021-08-25 19:59:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-08-25 19:59:13,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:13,916 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:13,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 19:59:13,917 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2021-08-25 19:59:13,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:59:13,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971326791] [2021-08-25 19:59:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:13,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:59:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:59:13,963 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 19:59:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:59:14,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 19:59:14,113 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 19:59:14,114 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 19:59:14,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 19:59:14,125 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 19:59:14,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:59:14 BoogieIcfgContainer [2021-08-25 19:59:14,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 19:59:14,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 19:59:14,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 19:59:14,233 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 19:59:14,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:10" (3/4) ... [2021-08-25 19:59:14,236 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 19:59:14,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 19:59:14,238 INFO L168 Benchmark]: Toolchain (without parser) took 4358.78 ms. Allocated memory was 62.9 MB in the beginning and 195.0 MB in the end (delta: 132.1 MB). Free memory was 41.7 MB in the beginning and 146.5 MB in the end (delta: -104.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,238 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:59:14,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.08 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 42.5 MB in the end (delta: -1.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 62.9 MB. Free memory was 42.3 MB in the beginning and 39.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,239 INFO L168 Benchmark]: Boogie Preprocessor took 58.39 ms. Allocated memory is still 62.9 MB. Free memory was 39.7 MB in the beginning and 37.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,239 INFO L168 Benchmark]: RCFGBuilder took 552.16 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 37.7 MB in the beginning and 38.4 MB in the end (delta: -689.6 kB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,240 INFO L168 Benchmark]: TraceAbstraction took 3307.40 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 37.8 MB in the beginning and 147.6 MB in the end (delta: -109.8 MB). Peak memory consumption was 45.5 MB. Max. memory is 16.1 GB. [2021-08-25 19:59:14,240 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 195.0 MB. Free memory was 147.6 MB in the beginning and 146.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:59:14,242 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.19 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.08 ms. Allocated memory is still 62.9 MB. Free memory was 41.5 MB in the beginning and 42.5 MB in the end (delta: -1.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 62.9 MB. Free memory was 42.3 MB in the beginning and 39.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.39 ms. Allocated memory is still 62.9 MB. Free memory was 39.7 MB in the beginning and 37.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 552.16 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 37.7 MB in the beginning and 38.4 MB in the end (delta: -689.6 kB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3307.40 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 37.8 MB in the beginning and 147.6 MB in the end (delta: -109.8 MB). Peak memory consumption was 45.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.55 ms. Allocated memory is still 195.0 MB. Free memory was 147.6 MB in the beginning and 146.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 610]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXor at line 358. Possible FailurePath: [L619] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y ; [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] ag_Y = 61087 [L319] s__state = 4416 [L320] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L324] ret = __VERIFIER_nondet_int() [L325] COND TRUE blastFlag == 3 [L326] blastFlag = 4 [L330] COND FALSE !(ret <= 0) [L335] s__state = 4432 [L336] ag_X = (unsigned short)65535 [L337] s__init_num = 0 [L338] COND FALSE !(! tmp___6) [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L347] ret = __VERIFIER_nondet_int() [L348] COND FALSE !(blastFlag == 5) [L353] COND FALSE !(ret <= 0) [L358] s__state = ag_X ^ ag_Y [L359] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] ag_Y = 61087 [L319] s__state = 4416 [L320] s__init_num = 0 [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L324] ret = __VERIFIER_nondet_int() [L325] COND FALSE !(blastFlag == 3) [L330] COND FALSE !(ret <= 0) [L335] s__state = 4432 [L336] ag_X = (unsigned short)65535 [L337] s__init_num = 0 [L338] COND FALSE !(! tmp___6) [L568] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L347] ret = __VERIFIER_nondet_int() [L348] COND TRUE blastFlag == 5 [L610] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3152.8ms, OverallIterations: 15, TraceHistogramMax: 11, EmptinessCheckTime: 41.0ms, AutomataDifference: 1530.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2634 SDtfs, 812 SDslu, 1502 SDs, 0 SdLazy, 896 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 808.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=14, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 259.0ms AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 61.2ms SsaConstructionTime, 281.2ms SatisfiabilityAnalysisTime, 584.9ms InterpolantComputationTime, 1686 NumberOfCodeBlocks, 1686 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 2960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2791/2791 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 [2021-08-25 19:59:14,278 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 19:59:16,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:59:16,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:59:16,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:59:16,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:59:16,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:59:16,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:59:16,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:59:16,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:59:16,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:59:16,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:59:16,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:59:16,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:59:16,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:59:16,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:59:16,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:59:16,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:59:16,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:59:16,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:59:16,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:59:16,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:59:16,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:59:16,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:59:16,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:59:16,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:59:16,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:59:16,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:59:16,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:59:16,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:59:16,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:59:16,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:59:16,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:59:16,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:59:16,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:59:16,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:59:16,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:59:16,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:59:16,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:59:16,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:59:16,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:59:16,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:59:16,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 19:59:16,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:59:16,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:59:16,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:59:16,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:59:16,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:59:16,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:59:16,283 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:59:16,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:59:16,284 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:59:16,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 19:59:16,285 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:59:16,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:59:16,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:59:16,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:59:16,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:59:16,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:59:16,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:59:16,296 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 19:59:16,297 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 19:59:16,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:59:16,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:59:16,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 19:59:16,297 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 -> 310063ef643a90e947dd66ba142cc8ae546f077a [2021-08-25 19:59:16,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:59:16,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:59:16,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:59:16,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:59:16,617 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:59:16,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:16,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a080615c5/7ec6b062ae7c480b8df2464b430b8770/FLAGb23da4da0 [2021-08-25 19:59:17,131 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:59:17,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:17,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a080615c5/7ec6b062ae7c480b8df2464b430b8770/FLAGb23da4da0 [2021-08-25 19:59:17,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a080615c5/7ec6b062ae7c480b8df2464b430b8770 [2021-08-25 19:59:17,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:59:17,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:59:17,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:59:17,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:59:17,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:59:17,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:17,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ef65e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17, skipping insertion in model container [2021-08-25 19:59:17,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:17,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:59:17,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:59:17,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37270,37283] [2021-08-25 19:59:17,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:59:17,794 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:59:17,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37270,37283] [2021-08-25 19:59:17,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:59:17,917 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:59:17,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17 WrapperNode [2021-08-25 19:59:17,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:59:17,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:59:17,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:59:17,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:59:17,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:17,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:17,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:59:17,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:59:17,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:59:17,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:59:18,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:59:18,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:59:18,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:59:18,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:59:18,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (1/1) ... [2021-08-25 19:59:18,057 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:59:18,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:59:18,076 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) [2021-08-25 19:59:18,095 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 [2021-08-25 19:59:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 19:59:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:59:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:59:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:59:18,311 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 19:59:18,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 19:59:18,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 19:59:18,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:59:18,828 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 19:59:18,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:18 BoogieIcfgContainer [2021-08-25 19:59:18,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:59:18,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:59:18,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:59:18,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:59:18,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:59:17" (1/3) ... [2021-08-25 19:59:18,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea92d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:59:18, skipping insertion in model container [2021-08-25 19:59:18,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:59:17" (2/3) ... [2021-08-25 19:59:18,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea92d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:59:18, skipping insertion in model container [2021-08-25 19:59:18,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:18" (3/3) ... [2021-08-25 19:59:18,836 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2021-08-25 19:59:18,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:59:18,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:59:18,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:59:18,879 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:59:18,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:59:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 19:59:18,897 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:18,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:18,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2021-08-25 19:59:18,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:18,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110393138] [2021-08-25 19:59:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:18,912 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:18,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:18,914 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) [2021-08-25 19:59:18,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 19:59:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:19,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:19,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:19,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:19,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:19,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110393138] [2021-08-25 19:59:19,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110393138] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:19,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:19,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:19,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845098851] [2021-08-25 19:59:19,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:19,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:19,404 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 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) [2021-08-25 19:59:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:19,636 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2021-08-25 19:59:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:19,638 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 [2021-08-25 19:59:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:19,648 INFO L225 Difference]: With dead ends: 246 [2021-08-25 19:59:19,649 INFO L226 Difference]: Without dead ends: 112 [2021-08-25 19:59:19,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-25 19:59:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-25 19:59:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-08-25 19:59:19,703 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2021-08-25 19:59:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:19,703 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-08-25 19:59:19,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-08-25 19:59:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 19:59:19,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:19,708 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:19,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:19,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:19,918 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2021-08-25 19:59:19,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:19,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943859375] [2021-08-25 19:59:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:19,920 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:19,921 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) [2021-08-25 19:59:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 19:59:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:20,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:20,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:20,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:59:20,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:20,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943859375] [2021-08-25 19:59:20,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943859375] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:20,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:20,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:20,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862377555] [2021-08-25 19:59:20,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:20,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:20,285 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:20,408 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2021-08-25 19:59:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-25 19:59:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:20,410 INFO L225 Difference]: With dead ends: 233 [2021-08-25 19:59:20,413 INFO L226 Difference]: Without dead ends: 131 [2021-08-25 19:59:20,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-25 19:59:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-08-25 19:59:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2021-08-25 19:59:20,423 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2021-08-25 19:59:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:20,423 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2021-08-25 19:59:20,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2021-08-25 19:59:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 19:59:20,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:20,425 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:20,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:20,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:20,634 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2021-08-25 19:59:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:20,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583055564] [2021-08-25 19:59:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:20,636 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:20,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:20,637 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) [2021-08-25 19:59:20,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 19:59:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:20,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:20,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:59:20,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:59:21,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:21,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583055564] [2021-08-25 19:59:21,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583055564] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:21,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:21,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:21,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503818600] [2021-08-25 19:59:21,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:21,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:21,093 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:21,225 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2021-08-25 19:59:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:21,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 50 [2021-08-25 19:59:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:21,228 INFO L225 Difference]: With dead ends: 265 [2021-08-25 19:59:21,228 INFO L226 Difference]: Without dead ends: 148 [2021-08-25 19:59:21,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-25 19:59:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2021-08-25 19:59:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2021-08-25 19:59:21,236 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2021-08-25 19:59:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:21,237 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2021-08-25 19:59:21,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2021-08-25 19:59:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 19:59:21,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:21,242 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:21,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:21,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:21,443 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2021-08-25 19:59:21,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:21,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360401942] [2021-08-25 19:59:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:21,445 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:21,446 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) [2021-08-25 19:59:21,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 19:59:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:21,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:21,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:21,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:22,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:22,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360401942] [2021-08-25 19:59:22,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360401942] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:22,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:22,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:22,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492022652] [2021-08-25 19:59:22,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:22,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:22,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:22,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:22,040 INFO L87 Difference]: Start difference. First operand 144 states and 211 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) [2021-08-25 19:59:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:22,272 INFO L93 Difference]: Finished difference Result 349 states and 534 transitions. [2021-08-25 19:59:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:22,272 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 67 [2021-08-25 19:59:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:22,274 INFO L225 Difference]: With dead ends: 349 [2021-08-25 19:59:22,274 INFO L226 Difference]: Without dead ends: 215 [2021-08-25 19:59:22,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-25 19:59:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 207. [2021-08-25 19:59:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2021-08-25 19:59:22,285 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 67 [2021-08-25 19:59:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:22,286 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2021-08-25 19:59:22,286 INFO L471 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) [2021-08-25 19:59:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2021-08-25 19:59:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-25 19:59:22,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:22,288 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:22,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:22,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:22,498 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:22,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1528022105, now seen corresponding path program 1 times [2021-08-25 19:59:22,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:22,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048950853] [2021-08-25 19:59:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:22,499 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:22,500 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) [2021-08-25 19:59:22,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 19:59:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:22,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:22,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:22,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 19:59:23,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:23,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048950853] [2021-08-25 19:59:23,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048950853] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:23,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:23,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:23,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683947819] [2021-08-25 19:59:23,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:23,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:23,129 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:23,278 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2021-08-25 19:59:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-25 19:59:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:23,280 INFO L225 Difference]: With dead ends: 427 [2021-08-25 19:59:23,280 INFO L226 Difference]: Without dead ends: 230 [2021-08-25 19:59:23,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-25 19:59:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2021-08-25 19:59:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4266666666666667) internal successors, (321), 225 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) [2021-08-25 19:59:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2021-08-25 19:59:23,291 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 68 [2021-08-25 19:59:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:23,292 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2021-08-25 19:59:23,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2021-08-25 19:59:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 19:59:23,293 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:23,294 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:23,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:23,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:23,503 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1678422895, now seen corresponding path program 1 times [2021-08-25 19:59:23,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:23,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468371311] [2021-08-25 19:59:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:23,504 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:23,505 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) [2021-08-25 19:59:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 19:59:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:23,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 19:59:23,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 19:59:24,120 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:24,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468371311] [2021-08-25 19:59:24,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468371311] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:24,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:24,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:24,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181962164] [2021-08-25 19:59:24,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:24,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:24,122 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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) [2021-08-25 19:59:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:24,364 INFO L93 Difference]: Finished difference Result 466 states and 670 transitions. [2021-08-25 19:59:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:24,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 84 [2021-08-25 19:59:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:24,366 INFO L225 Difference]: With dead ends: 466 [2021-08-25 19:59:24,366 INFO L226 Difference]: Without dead ends: 250 [2021-08-25 19:59:24,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-25 19:59:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2021-08-25 19:59:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.410569105691057) internal successors, (347), 246 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2021-08-25 19:59:24,374 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 84 [2021-08-25 19:59:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:24,374 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2021-08-25 19:59:24,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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) [2021-08-25 19:59:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2021-08-25 19:59:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 19:59:24,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:24,376 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:24,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:24,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:24,585 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2021-08-25 19:59:24,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:24,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305765033] [2021-08-25 19:59:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:24,587 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:24,589 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) [2021-08-25 19:59:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 19:59:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:24,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:24,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 19:59:25,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 19:59:25,445 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:25,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305765033] [2021-08-25 19:59:25,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305765033] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:25,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:25,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:25,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764064172] [2021-08-25 19:59:25,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:25,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:25,450 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:25,499 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2021-08-25 19:59:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 103 [2021-08-25 19:59:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:25,502 INFO L225 Difference]: With dead ends: 743 [2021-08-25 19:59:25,502 INFO L226 Difference]: Without dead ends: 506 [2021-08-25 19:59:25,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-08-25 19:59:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-08-25 19:59:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.39009900990099) internal successors, (702), 505 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 702 transitions. [2021-08-25 19:59:25,515 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 702 transitions. Word has length 103 [2021-08-25 19:59:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:25,516 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 702 transitions. [2021-08-25 19:59:25,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 702 transitions. [2021-08-25 19:59:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 19:59:25,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:25,518 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:25,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:25,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:25,728 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash -847602632, now seen corresponding path program 1 times [2021-08-25 19:59:25,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:25,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436816830] [2021-08-25 19:59:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:25,730 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:25,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:25,731 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) [2021-08-25 19:59:25,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 19:59:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:26,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:26,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 19:59:26,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 19:59:26,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:26,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436816830] [2021-08-25 19:59:26,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436816830] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:26,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:26,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:26,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593095815] [2021-08-25 19:59:26,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:26,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:26,566 INFO L87 Difference]: Start difference. First operand 506 states and 702 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:26,592 INFO L93 Difference]: Finished difference Result 1023 states and 1418 transitions. [2021-08-25 19:59:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:26,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 103 [2021-08-25 19:59:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:26,595 INFO L225 Difference]: With dead ends: 1023 [2021-08-25 19:59:26,595 INFO L226 Difference]: Without dead ends: 527 [2021-08-25 19:59:26,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-08-25 19:59:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2021-08-25 19:59:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3859315589353611) internal successors, (729), 526 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2021-08-25 19:59:26,608 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 103 [2021-08-25 19:59:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:26,609 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2021-08-25 19:59:26,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2021-08-25 19:59:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 19:59:26,610 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:26,610 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:26,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:26,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:26,822 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:26,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1168582955, now seen corresponding path program 1 times [2021-08-25 19:59:26,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:26,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143261621] [2021-08-25 19:59:26,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:26,823 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:26,824 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) [2021-08-25 19:59:26,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 19:59:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:27,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:27,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 19:59:27,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 19:59:27,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:27,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143261621] [2021-08-25 19:59:27,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143261621] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:27,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:27,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 19:59:27,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998185179] [2021-08-25 19:59:27,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:59:27,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:59:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:27,736 INFO L87 Difference]: Start difference. First operand 527 states and 729 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:27,764 INFO L93 Difference]: Finished difference Result 1070 states and 1478 transitions. [2021-08-25 19:59:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:59:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 19:59:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:27,768 INFO L225 Difference]: With dead ends: 1070 [2021-08-25 19:59:27,768 INFO L226 Difference]: Without dead ends: 553 [2021-08-25 19:59:27,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:59:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-08-25 19:59:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2021-08-25 19:59:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.3804347826086956) internal successors, (762), 552 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2021-08-25 19:59:27,783 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 104 [2021-08-25 19:59:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:27,784 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2021-08-25 19:59:27,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2021-08-25 19:59:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 19:59:27,785 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:27,786 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:27,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:27,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:27,996 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2021-08-25 19:59:27,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:27,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762502773] [2021-08-25 19:59:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:27,997 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:28,001 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) [2021-08-25 19:59:28,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 19:59:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:28,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:28,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 19:59:28,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 19:59:28,975 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:28,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762502773] [2021-08-25 19:59:28,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762502773] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:28,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:28,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:28,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509046756] [2021-08-25 19:59:28,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:28,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:28,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:28,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:28,977 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:29,039 INFO L93 Difference]: Finished difference Result 1520 states and 2113 transitions. [2021-08-25 19:59:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 19:59:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:29,043 INFO L225 Difference]: With dead ends: 1520 [2021-08-25 19:59:29,044 INFO L226 Difference]: Without dead ends: 1003 [2021-08-25 19:59:29,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-08-25 19:59:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2021-08-25 19:59:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3892215568862276) internal successors, (1392), 1002 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1392 transitions. [2021-08-25 19:59:29,077 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1392 transitions. Word has length 105 [2021-08-25 19:59:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:29,078 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1392 transitions. [2021-08-25 19:59:29,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1392 transitions. [2021-08-25 19:59:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 19:59:29,081 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:29,081 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:29,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:29,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:29,292 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2021-08-25 19:59:29,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:29,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530581944] [2021-08-25 19:59:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:29,293 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:29,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:29,294 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) [2021-08-25 19:59:29,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 19:59:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 19:59:30,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 19:59:30,625 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:30,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530581944] [2021-08-25 19:59:30,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530581944] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:30,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:30,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:30,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621398906] [2021-08-25 19:59:30,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:30,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:30,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:30,626 INFO L87 Difference]: Start difference. First operand 1003 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:30,832 INFO L93 Difference]: Finished difference Result 2091 states and 2938 transitions. [2021-08-25 19:59:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 173 [2021-08-25 19:59:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:30,837 INFO L225 Difference]: With dead ends: 2091 [2021-08-25 19:59:30,837 INFO L226 Difference]: Without dead ends: 1124 [2021-08-25 19:59:30,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-08-25 19:59:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1095. [2021-08-25 19:59:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3711151736745886) internal successors, (1500), 1094 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1500 transitions. [2021-08-25 19:59:30,872 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1500 transitions. Word has length 173 [2021-08-25 19:59:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:30,872 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 1500 transitions. [2021-08-25 19:59:30,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1500 transitions. [2021-08-25 19:59:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-25 19:59:30,875 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:30,876 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:30,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:31,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:31,086 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2021-08-25 19:59:31,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:31,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200617258] [2021-08-25 19:59:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:31,087 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:31,088 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) [2021-08-25 19:59:31,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 19:59:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:31,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 19:59:31,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 456 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 19:59:32,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 440 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 19:59:32,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:32,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200617258] [2021-08-25 19:59:32,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200617258] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:59:32,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:59:32,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-25 19:59:32,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499155447] [2021-08-25 19:59:32,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 19:59:32,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 19:59:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-25 19:59:32,880 INFO L87 Difference]: Start difference. First operand 1095 states and 1500 transitions. Second operand has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:33,372 INFO L93 Difference]: Finished difference Result 2572 states and 3550 transitions. [2021-08-25 19:59:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:59:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 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 194 [2021-08-25 19:59:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:33,378 INFO L225 Difference]: With dead ends: 2572 [2021-08-25 19:59:33,378 INFO L226 Difference]: Without dead ends: 1513 [2021-08-25 19:59:33,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:59:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-08-25 19:59:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1404. [2021-08-25 19:59:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.3642195295794726) internal successors, (1914), 1403 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1914 transitions. [2021-08-25 19:59:33,416 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1914 transitions. Word has length 194 [2021-08-25 19:59:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:33,417 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1914 transitions. [2021-08-25 19:59:33,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1914 transitions. [2021-08-25 19:59:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-08-25 19:59:33,421 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:33,422 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:33,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:33,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:33,640 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1233429647, now seen corresponding path program 1 times [2021-08-25 19:59:33,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:33,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900670096] [2021-08-25 19:59:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:33,641 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:33,642 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) [2021-08-25 19:59:33,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 19:59:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:34,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:34,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-08-25 19:59:34,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-08-25 19:59:35,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:35,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900670096] [2021-08-25 19:59:35,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900670096] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:35,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:35,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:35,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839272053] [2021-08-25 19:59:35,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:35,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:35,349 INFO L87 Difference]: Start difference. First operand 1404 states and 1914 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:35,570 INFO L93 Difference]: Finished difference Result 2921 states and 4033 transitions. [2021-08-25 19:59:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2021-08-25 19:59:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:35,576 INFO L225 Difference]: With dead ends: 2921 [2021-08-25 19:59:35,576 INFO L226 Difference]: Without dead ends: 1574 [2021-08-25 19:59:35,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-08-25 19:59:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1544. [2021-08-25 19:59:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.3441348023331172) internal successors, (2074), 1543 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2074 transitions. [2021-08-25 19:59:35,619 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2074 transitions. Word has length 219 [2021-08-25 19:59:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:35,620 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 2074 transitions. [2021-08-25 19:59:35,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2074 transitions. [2021-08-25 19:59:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-08-25 19:59:35,624 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:35,624 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 19:59:35,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:35,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:35,836 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1201727504, now seen corresponding path program 1 times [2021-08-25 19:59:35,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:35,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108216350] [2021-08-25 19:59:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:35,838 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:35,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:35,839 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) [2021-08-25 19:59:35,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 19:59:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:36,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:36,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 19:59:37,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 19:59:37,645 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:37,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108216350] [2021-08-25 19:59:37,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108216350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:37,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:37,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:37,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021912356] [2021-08-25 19:59:37,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:37,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:37,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:37,646 INFO L87 Difference]: Start difference. First operand 1544 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:37,857 INFO L93 Difference]: Finished difference Result 3201 states and 4369 transitions. [2021-08-25 19:59:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 230 [2021-08-25 19:59:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:37,864 INFO L225 Difference]: With dead ends: 3201 [2021-08-25 19:59:37,864 INFO L226 Difference]: Without dead ends: 1714 [2021-08-25 19:59:37,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-08-25 19:59:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1699. [2021-08-25 19:59:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3244994110718493) internal successors, (2249), 1698 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2249 transitions. [2021-08-25 19:59:37,902 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2249 transitions. Word has length 230 [2021-08-25 19:59:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:37,902 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2249 transitions. [2021-08-25 19:59:37,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2249 transitions. [2021-08-25 19:59:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-08-25 19:59:37,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:37,907 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:37,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:38,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:38,119 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1748413006, now seen corresponding path program 1 times [2021-08-25 19:59:38,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:38,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482444562] [2021-08-25 19:59:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:38,120 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:38,122 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) [2021-08-25 19:59:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 19:59:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:39,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:39,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-08-25 19:59:39,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-08-25 19:59:40,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:40,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482444562] [2021-08-25 19:59:40,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482444562] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:40,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:40,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:40,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829119508] [2021-08-25 19:59:40,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:40,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:40,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:40,140 INFO L87 Difference]: Start difference. First operand 1699 states and 2249 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:40,335 INFO L93 Difference]: Finished difference Result 3576 states and 4804 transitions. [2021-08-25 19:59:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 260 [2021-08-25 19:59:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:40,342 INFO L225 Difference]: With dead ends: 3576 [2021-08-25 19:59:40,342 INFO L226 Difference]: Without dead ends: 1934 [2021-08-25 19:59:40,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2021-08-25 19:59:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1884. [2021-08-25 19:59:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 1.30323951141795) internal successors, (2454), 1883 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2454 transitions. [2021-08-25 19:59:40,395 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2454 transitions. Word has length 260 [2021-08-25 19:59:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:40,396 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 2454 transitions. [2021-08-25 19:59:40,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2454 transitions. [2021-08-25 19:59:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-08-25 19:59:40,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:40,401 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:40,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:40,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:40,613 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -541056141, now seen corresponding path program 1 times [2021-08-25 19:59:40,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:40,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945643174] [2021-08-25 19:59:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:40,615 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:40,616 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) [2021-08-25 19:59:40,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 19:59:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:41,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:41,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2021-08-25 19:59:42,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2021-08-25 19:59:42,810 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:42,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945643174] [2021-08-25 19:59:42,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945643174] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:42,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:42,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:42,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336681903] [2021-08-25 19:59:42,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:42,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:42,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:42,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:42,811 INFO L87 Difference]: Start difference. First operand 1884 states and 2454 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:42,888 INFO L93 Difference]: Finished difference Result 7200 states and 9404 transitions. [2021-08-25 19:59:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2021-08-25 19:59:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:42,906 INFO L225 Difference]: With dead ends: 7200 [2021-08-25 19:59:42,906 INFO L226 Difference]: Without dead ends: 5373 [2021-08-25 19:59:42,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2021-08-25 19:59:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 5369. [2021-08-25 19:59:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 5368 states have (on average 1.305327868852459) internal successors, (7007), 5368 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7007 transitions. [2021-08-25 19:59:43,027 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7007 transitions. Word has length 261 [2021-08-25 19:59:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:43,028 INFO L470 AbstractCegarLoop]: Abstraction has 5369 states and 7007 transitions. [2021-08-25 19:59:43,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7007 transitions. [2021-08-25 19:59:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2021-08-25 19:59:43,039 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:43,039 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:43,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:43,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:43,251 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1252386761, now seen corresponding path program 1 times [2021-08-25 19:59:43,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:43,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560576796] [2021-08-25 19:59:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:43,252 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:43,253 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) [2021-08-25 19:59:43,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 19:59:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:44,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:44,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2021-08-25 19:59:45,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2021-08-25 19:59:45,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:45,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560576796] [2021-08-25 19:59:45,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560576796] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:45,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:45,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:45,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129994302] [2021-08-25 19:59:45,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:45,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:45,630 INFO L87 Difference]: Start difference. First operand 5369 states and 7007 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:45,851 INFO L93 Difference]: Finished difference Result 10996 states and 14405 transitions. [2021-08-25 19:59:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 285 [2021-08-25 19:59:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:45,869 INFO L225 Difference]: With dead ends: 10996 [2021-08-25 19:59:45,869 INFO L226 Difference]: Without dead ends: 5684 [2021-08-25 19:59:45,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2021-08-25 19:59:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5534. [2021-08-25 19:59:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 5533 states have (on average 1.2980300018073379) internal successors, (7182), 5533 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7182 transitions. [2021-08-25 19:59:46,004 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7182 transitions. Word has length 285 [2021-08-25 19:59:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:46,005 INFO L470 AbstractCegarLoop]: Abstraction has 5534 states and 7182 transitions. [2021-08-25 19:59:46,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7182 transitions. [2021-08-25 19:59:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-08-25 19:59:46,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:46,020 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:46,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:46,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:46,233 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1370167796, now seen corresponding path program 1 times [2021-08-25 19:59:46,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:46,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519943043] [2021-08-25 19:59:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:46,234 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:46,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:46,234 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) [2021-08-25 19:59:46,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-25 19:59:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:47,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:47,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-08-25 19:59:48,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-08-25 19:59:48,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:48,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519943043] [2021-08-25 19:59:48,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519943043] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:48,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:48,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:48,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966513280] [2021-08-25 19:59:48,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:48,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:48,841 INFO L87 Difference]: Start difference. First operand 5534 states and 7182 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:49,073 INFO L93 Difference]: Finished difference Result 11716 states and 15430 transitions. [2021-08-25 19:59:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 297 [2021-08-25 19:59:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:49,093 INFO L225 Difference]: With dead ends: 11716 [2021-08-25 19:59:49,094 INFO L226 Difference]: Without dead ends: 6239 [2021-08-25 19:59:49,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6239 states. [2021-08-25 19:59:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6239 to 6089. [2021-08-25 19:59:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6089 states, 6088 states have (on average 1.2807161629434953) internal successors, (7797), 6088 states have internal predecessors, (7797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 7797 transitions. [2021-08-25 19:59:49,265 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 7797 transitions. Word has length 297 [2021-08-25 19:59:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:49,265 INFO L470 AbstractCegarLoop]: Abstraction has 6089 states and 7797 transitions. [2021-08-25 19:59:49,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 7797 transitions. [2021-08-25 19:59:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2021-08-25 19:59:49,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:49,277 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:49,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:49,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:49,489 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 814591708, now seen corresponding path program 1 times [2021-08-25 19:59:49,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:49,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124126898] [2021-08-25 19:59:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:49,491 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:49,492 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) [2021-08-25 19:59:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-25 19:59:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:51,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:51,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 19:59:51,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 19:59:52,420 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:52,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124126898] [2021-08-25 19:59:52,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124126898] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:59:52,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:59:52,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:59:52,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32838714] [2021-08-25 19:59:52,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:59:52,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:59:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:52,422 INFO L87 Difference]: Start difference. First operand 6089 states and 7797 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:52,667 INFO L93 Difference]: Finished difference Result 12871 states and 16735 transitions. [2021-08-25 19:59:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:59:52,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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 334 [2021-08-25 19:59:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:52,678 INFO L225 Difference]: With dead ends: 12871 [2021-08-25 19:59:52,678 INFO L226 Difference]: Without dead ends: 6839 [2021-08-25 19:59:52,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:59:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2021-08-25 19:59:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6704. [2021-08-25 19:59:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6704 states, 6703 states have (on average 1.2639116813367148) internal successors, (8472), 6703 states have internal predecessors, (8472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6704 states to 6704 states and 8472 transitions. [2021-08-25 19:59:52,810 INFO L78 Accepts]: Start accepts. Automaton has 6704 states and 8472 transitions. Word has length 334 [2021-08-25 19:59:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:52,810 INFO L470 AbstractCegarLoop]: Abstraction has 6704 states and 8472 transitions. [2021-08-25 19:59:52,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6704 states and 8472 transitions. [2021-08-25 19:59:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-08-25 19:59:52,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:52,822 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:52,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:53,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:53,035 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 562644076, now seen corresponding path program 1 times [2021-08-25 19:59:53,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:53,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546746226] [2021-08-25 19:59:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:53,036 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:53,037 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) [2021-08-25 19:59:53,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-25 19:59:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:54,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 19:59:54,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:59:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2021-08-25 19:59:55,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:59:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2021-08-25 19:59:56,214 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:59:56,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546746226] [2021-08-25 19:59:56,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546746226] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:59:56,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:59:56,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 19:59:56,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907742330] [2021-08-25 19:59:56,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:59:56,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:59:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:59:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:59:56,216 INFO L87 Difference]: Start difference. First operand 6704 states and 8472 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:59:57,075 INFO L93 Difference]: Finished difference Result 21875 states and 27687 transitions. [2021-08-25 19:59:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 19:59:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 357 [2021-08-25 19:59:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:59:57,103 INFO L225 Difference]: With dead ends: 21875 [2021-08-25 19:59:57,103 INFO L226 Difference]: Without dead ends: 15228 [2021-08-25 19:59:57,113 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.1ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:59:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15228 states. [2021-08-25 19:59:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15228 to 9232. [2021-08-25 19:59:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9232 states, 9231 states have (on average 1.2807929801754956) internal successors, (11823), 9231 states have internal predecessors, (11823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9232 states to 9232 states and 11823 transitions. [2021-08-25 19:59:57,316 INFO L78 Accepts]: Start accepts. Automaton has 9232 states and 11823 transitions. Word has length 357 [2021-08-25 19:59:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:59:57,316 INFO L470 AbstractCegarLoop]: Abstraction has 9232 states and 11823 transitions. [2021-08-25 19:59:57,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:59:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9232 states and 11823 transitions. [2021-08-25 19:59:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-08-25 19:59:57,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:59:57,335 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:59:57,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-25 19:59:57,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:59:57,549 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:59:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:59:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 78805813, now seen corresponding path program 1 times [2021-08-25 19:59:57,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:59:57,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480158345] [2021-08-25 19:59:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:59:57,550 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:59:57,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:59:57,552 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) [2021-08-25 19:59:57,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-25 19:59:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:59:59,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:59:59,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2021-08-25 20:00:00,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2021-08-25 20:00:01,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:01,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480158345] [2021-08-25 20:00:01,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480158345] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:01,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:01,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:01,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812873668] [2021-08-25 20:00:01,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:01,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:01,018 INFO L87 Difference]: Start difference. First operand 9232 states and 11823 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:01,170 INFO L93 Difference]: Finished difference Result 19629 states and 24779 transitions. [2021-08-25 20:00:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 359 [2021-08-25 20:00:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:01,190 INFO L225 Difference]: With dead ends: 19629 [2021-08-25 20:00:01,190 INFO L226 Difference]: Without dead ends: 10454 [2021-08-25 20:00:01,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10454 states. [2021-08-25 20:00:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10454 to 10024. [2021-08-25 20:00:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10024 states, 10023 states have (on average 1.2466327446872194) internal successors, (12495), 10023 states have internal predecessors, (12495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10024 states to 10024 states and 12495 transitions. [2021-08-25 20:00:01,398 INFO L78 Accepts]: Start accepts. Automaton has 10024 states and 12495 transitions. Word has length 359 [2021-08-25 20:00:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:01,399 INFO L470 AbstractCegarLoop]: Abstraction has 10024 states and 12495 transitions. [2021-08-25 20:00:01,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 10024 states and 12495 transitions. [2021-08-25 20:00:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2021-08-25 20:00:01,415 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:01,415 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 11, 11, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:01,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:01,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:01,630 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1396739116, now seen corresponding path program 1 times [2021-08-25 20:00:01,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:01,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531295833] [2021-08-25 20:00:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:01,631 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:01,632 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) [2021-08-25 20:00:01,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-25 20:00:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:04,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:04,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2021-08-25 20:00:05,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2021-08-25 20:00:06,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:06,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531295833] [2021-08-25 20:00:06,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531295833] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:06,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:06,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:06,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046268921] [2021-08-25 20:00:06,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:06,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:06,546 INFO L87 Difference]: Start difference. First operand 10024 states and 12495 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:06,725 INFO L93 Difference]: Finished difference Result 15258 states and 19066 transitions. [2021-08-25 20:00:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2021-08-25 20:00:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:06,768 INFO L225 Difference]: With dead ends: 15258 [2021-08-25 20:00:06,769 INFO L226 Difference]: Without dead ends: 6496 [2021-08-25 20:00:06,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2021-08-25 20:00:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6494. [2021-08-25 20:00:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 1.2590482057600494) internal successors, (8175), 6493 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8175 transitions. [2021-08-25 20:00:06,998 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8175 transitions. Word has length 434 [2021-08-25 20:00:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:06,999 INFO L470 AbstractCegarLoop]: Abstraction has 6494 states and 8175 transitions. [2021-08-25 20:00:06,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8175 transitions. [2021-08-25 20:00:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2021-08-25 20:00:07,010 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:07,010 INFO L512 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 14, 14, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:07,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:07,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:07,225 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -839302048, now seen corresponding path program 1 times [2021-08-25 20:00:07,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:07,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878641883] [2021-08-25 20:00:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:07,226 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:07,237 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) [2021-08-25 20:00:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-25 20:00:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:10,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:10,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2021-08-25 20:00:11,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2021-08-25 20:00:12,997 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:12,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878641883] [2021-08-25 20:00:12,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878641883] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:12,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:12,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:00:12,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871105229] [2021-08-25 20:00:12,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:00:12,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:00:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:13,000 INFO L87 Difference]: Start difference. First operand 6494 states and 8175 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:13,282 INFO L93 Difference]: Finished difference Result 13252 states and 16870 transitions. [2021-08-25 20:00:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:00:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 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 544 [2021-08-25 20:00:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:13,324 INFO L225 Difference]: With dead ends: 13252 [2021-08-25 20:00:13,325 INFO L226 Difference]: Without dead ends: 6185 [2021-08-25 20:00:13,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1086 GetRequests, 1084 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6185 states. [2021-08-25 20:00:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6185 to 6134. [2021-08-25 20:00:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.2449046143812164) internal successors, (7635), 6133 states have internal predecessors, (7635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7635 transitions. [2021-08-25 20:00:13,473 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7635 transitions. Word has length 544 [2021-08-25 20:00:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:13,473 INFO L470 AbstractCegarLoop]: Abstraction has 6134 states and 7635 transitions. [2021-08-25 20:00:13,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7635 transitions. [2021-08-25 20:00:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2021-08-25 20:00:13,484 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:13,484 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:13,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:13,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:13,701 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1723660819, now seen corresponding path program 1 times [2021-08-25 20:00:13,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:13,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505303548] [2021-08-25 20:00:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:13,702 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:13,717 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:00:13,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-25 20:00:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:17,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:00:17,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2021-08-25 20:00:18,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2021-08-25 20:00:20,294 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:20,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505303548] [2021-08-25 20:00:20,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505303548] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:00:20,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:00:20,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 20:00:20,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716004450] [2021-08-25 20:00:20,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:00:20,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:20,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:00:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:00:20,296 INFO L87 Difference]: Start difference. First operand 6134 states and 7635 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:20,635 INFO L93 Difference]: Finished difference Result 6347 states and 7905 transitions. [2021-08-25 20:00:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:00:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 619 [2021-08-25 20:00:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:20,649 INFO L225 Difference]: With dead ends: 6347 [2021-08-25 20:00:20,653 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:00:20,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:00:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:00:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:00:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:00:20,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 619 [2021-08-25 20:00:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:20,671 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:00:20,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:00:20,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:00:20,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:00:20,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:20,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:20,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:00:20,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:20,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:20,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:21,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:22,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:00:26,914 INFO L853 garLoopResultBuilder]: At program point L135(lines 131 556) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32)))) [2021-08-25 20:00:26,915 INFO L853 garLoopResultBuilder]: At program point L532(lines 95 598) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)))) (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv3 32))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4368 32)))) (.cse11 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) (.cse12 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4528 32))) (.cse2 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse3 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse8 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse6 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse10 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse9 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4512 32))) (.cse5 (not .cse7))) (or (and .cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse6) (and .cse10 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4560 32)) .cse5) (and .cse2 .cse3 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8 .cse6) (and .cse2 .cse3 .cse7 .cse8 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse6) (and (not .cse0) .cse2 .cse3 .cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) .cse8 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4560 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) .cse6) (and .cse2 .cse7 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4416 32)) .cse8) (and .cse1 .cse10 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse8 .cse6) (and .cse2 .cse3 .cse7 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse6) (and .cse2 .cse3 .cse7 .cse12 .cse8 .cse6) (and .cse10 .cse7 .cse11) (and .cse2 .cse3 .cse7 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4448 32)) .cse8 .cse6) (and (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv3 32)) .cse10 .cse5 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4352 32))) (and .cse10 .cse12 .cse5) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4384 32))) (and .cse2 .cse3 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4496 32)) .cse7 .cse8 .cse6) (and .cse10 .cse9 .cse5)))) [2021-08-25 20:00:26,915 INFO L860 garLoopResultBuilder]: At program point L599(lines 94 600) the Hoare annotation is: true [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L170(lines 170 543) no Hoare annotation was computed. [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L137(lines 137 554) no Hoare annotation was computed. [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 565) no Hoare annotation was computed. [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L369(lines 369 373) no Hoare annotation was computed. [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L369-2(lines 369 373) no Hoare annotation was computed. [2021-08-25 20:00:26,915 INFO L857 garLoopResultBuilder]: For program point L303-1(lines 303 317) no Hoare annotation was computed. [2021-08-25 20:00:26,916 INFO L853 garLoopResultBuilder]: At program point L204(lines 101 566) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32)))) [2021-08-25 20:00:26,916 INFO L853 garLoopResultBuilder]: At program point L171(lines 167 544) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2021-08-25 20:00:26,916 INFO L857 garLoopResultBuilder]: For program point L568(lines 568 596) no Hoare annotation was computed. [2021-08-25 20:00:26,916 INFO L857 garLoopResultBuilder]: For program point L569(lines 569 593) no Hoare annotation was computed. [2021-08-25 20:00:26,916 INFO L857 garLoopResultBuilder]: For program point L503-1(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,916 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 343) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L173(lines 173 542) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 553) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 564) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L603(lines 603 607) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L570(lines 570 579) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L603-2(lines 603 607) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L857 garLoopResultBuilder]: For program point L570-2(lines 569 591) no Hoare annotation was computed. [2021-08-25 20:00:26,917 INFO L853 garLoopResultBuilder]: At program point L141(lines 137 554) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L75(lines 75 83) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L307-2(lines 305 317) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L572(lines 572 576) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L440(lines 440 445) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L275(lines 275 279) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L209(lines 209 213) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L176(lines 176 541) no Hoare annotation was computed. [2021-08-25 20:00:26,918 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 552) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L209-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 563) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L853 garLoopResultBuilder]: At program point L177(lines 173 542) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32)))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32)))) (.cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32)))) (.cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32)))) (.cse6 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32)))) (.cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32)))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse8 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))))) (or (and .cse0 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse0 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) .cse6 .cse7 (not .cse2) .cse8))) [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L508-1(lines 508 512) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-08-25 20:00:26,919 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 250) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L179(lines 179 540) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L146(lines 146 551) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 562) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L853 garLoopResultBuilder]: At program point L147(lines 143 552) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L479(lines 479 483) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L479-2(lines 479 483) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 539) no Hoare annotation was computed. [2021-08-25 20:00:26,920 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 550) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 561) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L381(lines 381 385) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L348(lines 348 352) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L853 garLoopResultBuilder]: At program point L183(lines 179 540) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32)))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32)))) (.cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32)))) (.cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32)))) (.cse6 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32)))) (.cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32)))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse8 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))))) (or (and .cse0 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse0 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) .cse6 .cse7 (not .cse2) .cse8))) [2021-08-25 20:00:26,921 INFO L853 garLoopResultBuilder]: At program point L117(lines 113 562) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32)))) [2021-08-25 20:00:26,921 INFO L853 garLoopResultBuilder]: At program point L349(lines 67 616) the Hoare annotation is: false [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L860 garLoopResultBuilder]: At program point L614(lines 67 616) the Hoare annotation is: true [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 587) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L515(lines 515 519) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L515-2(lines 515 519) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2021-08-25 20:00:26,921 INFO L857 garLoopResultBuilder]: For program point L284-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L185(lines 185 538) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 549) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 560) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L860 garLoopResultBuilder]: At program point L615(lines 10 617) the Hoare annotation is: true [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L450(lines 450 454) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L221(lines 221 238) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L188(lines 188 537) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 548) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L221-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 559) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L853 garLoopResultBuilder]: At program point L189(lines 185 538) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32)))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32)))) (.cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32)))) (.cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32)))) (.cse6 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32)))) (.cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32)))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse8 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))))) (or (and .cse0 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4560 32)) .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse0 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) .cse6 .cse7 (not .cse2) .cse8))) [2021-08-25 20:00:26,922 INFO L853 garLoopResultBuilder]: At program point L123(lines 119 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32)))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32)))) (.cse3 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32)))) (.cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32)))) (.cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32)))) (.cse6 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32)))) (.cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))))) (or (and .cse0 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4560 32)) .cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4400 32))) .cse5 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7))) [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L487-1(lines 487 499) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L421(lines 421 425) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 228) no Hoare annotation was computed. [2021-08-25 20:00:26,922 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 536) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 547) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 558) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L522(lines 522 526) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L853 garLoopResultBuilder]: At program point L192(lines 191 536) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4352 32)))) (or (and (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse0 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4560 32)) .cse1 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv3 32)) (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not .cse0) .cse1))) [2021-08-25 20:00:26,923 INFO L853 garLoopResultBuilder]: At program point L159(lines 149 550) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L490(lines 490 495) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L457(lines 457 468) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L457-1(lines 457 468) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2021-08-25 20:00:26,923 INFO L857 garLoopResultBuilder]: For program point L259(lines 259 267) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L325-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L392(lines 392 396) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L194(lines 194 535) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 546) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 557) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L95-1(lines 67 616) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L459(lines 459 465) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L857 garLoopResultBuilder]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:00:26,924 INFO L860 garLoopResultBuilder]: At program point L195(lines 194 535) the Hoare annotation is: true [2021-08-25 20:00:26,925 INFO L853 garLoopResultBuilder]: At program point L129(lines 125 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32)))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32)))) (.cse4 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32)))) (.cse5 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32)))) (.cse6 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32)))) (.cse7 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32)))) (.cse8 (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse0 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L262(lines 262 266) no Hoare annotation was computed. [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 234) no Hoare annotation was computed. [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L262-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,925 INFO L860 garLoopResultBuilder]: At program point L626(lines 618 628) the Hoare annotation is: true [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 545) no Hoare annotation was computed. [2021-08-25 20:00:26,925 INFO L857 garLoopResultBuilder]: For program point L131(lines 131 556) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 567) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 610) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L429(lines 429 433) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L429-2(lines 199 531) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L860 garLoopResultBuilder]: At program point L198(lines 197 534) the Hoare annotation is: true [2021-08-25 20:00:26,926 INFO L853 garLoopResultBuilder]: At program point L165(lines 161 546) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4368 32))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4096 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv20480 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4369 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv16384 32))) (not (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4099 32))) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2021-08-25 20:00:26,926 INFO L853 garLoopResultBuilder]: At program point L99(lines 98 567) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv12292 32))) [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 403) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L398-2(lines 398 403) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 544) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 555) no Hoare annotation was computed. [2021-08-25 20:00:26,926 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 566) no Hoare annotation was computed. [2021-08-25 20:00:26,930 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:00:26,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:00:26 BoogieIcfgContainer [2021-08-25 20:00:26,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:00:26,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:00:26,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:00:26,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:00:26,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:59:18" (3/4) ... [2021-08-25 20:00:26,965 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:00:26,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-25 20:00:26,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:00:26,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:00:26,982 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:00:27,079 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:00:27,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:00:27,082 INFO L168 Benchmark]: Toolchain (without parser) took 69568.68 ms. Allocated memory was 48.2 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 23.2 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 86.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,082 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 48.2 MB. Free memory was 30.4 MB in the beginning and 30.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:00:27,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.57 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.0 MB in the beginning and 39.3 MB in the end (delta: -16.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.46 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 36.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,084 INFO L168 Benchmark]: Boogie Preprocessor took 53.46 ms. Allocated memory is still 58.7 MB. Free memory was 36.8 MB in the beginning and 34.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,084 INFO L168 Benchmark]: RCFGBuilder took 781.42 ms. Allocated memory is still 58.7 MB. Free memory was 34.8 MB in the beginning and 34.2 MB in the end (delta: 658.9 kB). Peak memory consumption was 17.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,084 INFO L168 Benchmark]: TraceAbstraction took 68129.55 ms. Allocated memory was 58.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 33.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 840.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,085 INFO L168 Benchmark]: Witness Printer took 118.28 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:27,088 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.24 ms. Allocated memory is still 48.2 MB. Free memory was 30.4 MB in the beginning and 30.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 410.57 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.0 MB in the beginning and 39.3 MB in the end (delta: -16.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.46 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 36.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.46 ms. Allocated memory is still 58.7 MB. Free memory was 36.8 MB in the beginning and 34.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 781.42 ms. Allocated memory is still 58.7 MB. Free memory was 34.8 MB in the beginning and 34.2 MB in the end (delta: 658.9 kB). Peak memory consumption was 17.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 68129.55 ms. Allocated memory was 58.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 33.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 840.6 MB. Max. memory is 16.1 GB. * Witness Printer took 118.28 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 610]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68056.9ms, OverallIterations: 24, TraceHistogramMax: 22, EmptinessCheckTime: 148.9ms, AutomataDifference: 5601.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6024.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4339 SDtfs, 3895 SDslu, 3909 SDs, 0 SdLazy, 3760 SolverSat, 660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2872.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10590 GetRequests, 10534 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 217.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10024occurred in iteration=21, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1640.0ms AutomataMinimizationTime, 24 MinimizatonAttempts, 7174 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 272 NumberOfFragments, 1234 HoareAnnotationTreeSize, 23 FomulaSimplifications, 18092 FormulaSimplificationTreeSizeReduction, 1675.2ms HoareSimplificationTime, 23 FomulaSimplificationsInter, 14631 FormulaSimplificationTreeSizeReductionInter, 4332.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 469.1ms SsaConstructionTime, 1424.8ms SatisfiabilityAnalysisTime, 25474.1ms InterpolantComputationTime, 5310 NumberOfCodeBlocks, 5310 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 10572 ConstructedInterpolants, 0 QuantifiedInterpolants, 14469 SizeOfPredicates, 4 NumberOfNonLiveVariables, 7315 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 43356/43460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X) || ((((((((((!(s__state == 4368bv32) && 2bv32 == blastFlag) && !(4432bv32 == s__state)) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__hit == 0bv32)) && !(s__state == 4099bv32)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && s__s3__tmp__next_state___0 == 4560bv32) && !(s__state == 4099bv32)) && 65535bv32 == ag_X) || ((((((((((!(s__state == 4368bv32) && 2bv32 == blastFlag) && !(4432bv32 == s__state)) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__hit == 0bv32)) && !(s__state == 4099bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((0bv32 == blastFlag && !(4432bv32 == s__state)) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && s__s3__tmp__next_state___0 == 4560bv32) && !(s__state == 4099bv32)) && 65535bv32 == ag_X) || (((((((((!(s__state == 4368bv32) && !(4432bv32 == s__state)) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && 1bv32 == blastFlag) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((s__state == 4368bv32 && 0bv32 == blastFlag) || (((((!(s__s3__tmp__next_state___0 == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && s__state == 3bv32) && !(s__hit == 0bv32)) && 65535bv32 == ag_X)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && !(5bv32 == blastFlag)) && s__state == 4512bv32) && 65535bv32 == ag_X)) || ((2bv32 == blastFlag && s__state == 4560bv32) && !(s__hit == 0bv32))) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && 4464bv32 == s__state) && s__hit == 0bv32) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && !(5bv32 == blastFlag)) && 4480bv32 == s__state) && 65535bv32 == ag_X)) || ((((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && s__s3__tmp__next_state___0 == 4560bv32) && !(s__state == 4099bv32)) && 65535bv32 == ag_X)) || (((61087bv32 == ag_Y && s__hit == 0bv32) && s__state == 4416bv32) && !(5bv32 == blastFlag))) || (((!(s__s3__tmp__next_state___0 == 4368bv32) && 2bv32 == blastFlag) && s__state == 3bv32) && !(s__hit == 0bv32))) || ((((((!(s__s3__tmp__next_state___0 == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && s__hit == 0bv32) && s__state == 4400bv32) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && 4432bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && s__state == 4528bv32) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || ((2bv32 == blastFlag && s__hit == 0bv32) && s__state == 4400bv32)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && s__state == 4448bv32) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || (((s__s3__tmp__next_state___0 == 3bv32 && 2bv32 == blastFlag) && !(s__hit == 0bv32)) && s__state == 4352bv32)) || ((2bv32 == blastFlag && s__state == 4528bv32) && !(s__hit == 0bv32))) || (1bv32 == blastFlag && s__state == 4384bv32)) || (((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__state == 4496bv32) && s__hit == 0bv32) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X)) || ((2bv32 == blastFlag && s__state == 4512bv32) && !(s__hit == 0bv32)) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0bv32 == blastFlag && s__state == 12292bv32 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((!(s__state == 4368bv32) && 0bv32 == blastFlag) && !(4432bv32 == s__state)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((61087bv32 == ag_Y && !(3bv32 == blastFlag)) && s__hit == 0bv32) && !(5bv32 == blastFlag)) && s__s3__tmp__next_state___0 == 4560bv32) && s__state == 4352bv32) && 65535bv32 == ag_X) || (((s__s3__tmp__next_state___0 == 3bv32 && 2bv32 == blastFlag) && !(s__hit == 0bv32)) && s__state == 4352bv32) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 4368bv32) && !(s__s3__tmp__next_state___0 == 4368bv32)) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X) || (((((((((!(s__state == 4368bv32) && 2bv32 == blastFlag) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X) || ((((((((((!(s__state == 4368bv32) && 2bv32 == blastFlag) && !(4432bv32 == s__state)) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(s__state == 4400bv32)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__hit == 0bv32)) && !(s__state == 4099bv32)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 4368bv32) && 61087bv32 == ag_Y) && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && s__hit == 0bv32) && !(s__state == 4096bv32)) && !(s__state == 20480bv32)) && !(s__state == 12292bv32)) && !(5bv32 == blastFlag)) && !(s__state == 4369bv32)) && !(s__state == 16384bv32)) && !(s__state == 4099bv32)) && 65535bv32 == ag_X RESULT: Ultimate proved your program to be correct! [2021-08-25 20:00:27,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...